This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n points in the plane. Give an O( n log n ) time algorithm to find two points in P that are closest together. Show that your algorithm is correct. 4. Prove that the breakpoints of the beach line, as defined in Section 7.2, trace out the Voronoi diagram while the sweep line moves from top to bottom....
View
Full
Document
 Spring '11
 Mukherjee

Click to edit the document details