Hw5 - n points in the plane. Give an O( n log n ) time...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COT5520 Computational Geometry Homework Assignment # 5 Due: November 05, 2003 1. Prove that for any , there is a set of point sites in the plane such that one of the cells of Vor( 3 > n n P ) has vertices . 1 n 2. Show that Theorem 7.3 implies that the average number of vertices of a Voronoi cell is less than six. 3. Let P be a set of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online