Unformatted text preview: Problem 3. [Divide and Conquer] Let p = ( x,y ) and p = ( x ,y ) be two points in the Euclidean plane given by their coordinates. We say that p dominates p if and only if x > x and y > y . Given a set of n points P = { p 1 ,...,p n } , a point p i ∈ P is undominated in P if there is no other point p j ∈ P such that p j dominates p i . Describe an algorithm that given P outputs all the undominated points in P ; see ﬁgure. Your algorithm should run in time asymptotically faster than O ( n 2 ) Figure 1: The undominated points are shown as unﬁlled circles. 1...
View
Full
Document
This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details