Lecture 7 Voronoi Diagrams.ppt

Lecture 7: Voronoi Diagrams Presented by Allen Miu 6.838 Computational Geometry September 27, 2001 Post Office: What is the area of service? Definition of Voronoi Diagram Let P be a set of n distinct points sites in the plane. The Voronoi diagram of P is the subdivision of the plane into n cells, one for each site. A point q lies in the cell corresponding to a site pi ? P iff Euclidean_Distance q, pi Euclidean_distance q, pj , for each pi ? P, j ? i. Demo http://www.diku.dk/students/duff/Fortune//~schaudt/voronoi/voronoi.html Voronoi Diagram Example:1 site Two sites form a perpendicular bisector Collinear sites form a series of parallel lines Non-collinear sites form Voronoi half lines that meet at a vertex Voronoi Cells and Segments Voronoi Cells and Segments Who wants to be a Millionaire? Who wants to be a Millionaire? Degenerate Case: no bounded cells! Summary of Voronoi Properties A point q lies on a Voronoi edge between sites pi and pj iff the largest empty circle centered at q touches only pi and pj A Voronoi edge is a subset of locus of points equidistant from pi and pj Summary of Voronoi Properties A point q is a vertex iff the largest empty circle centered at q touches at least 3 sites A Voronoi vertex is an intersection of 3 more segments, each equidistant from a pair of sites Outline Definitions and Examples Properties of Voronoi diagrams Complexity of Voronoi diagrams Constructing Voronoi diagrams Intuitions Data Structures Algorithm Running Time Analysis Demo Duality and degenerate cases Voronoi diagrams have linear complexity |v|, |e| O n Intuition: Not all bisectors are Voronoi edges! Voronoi diagrams have linear complexity |v|, |e| O n Claim: For n ? 3, |v| ? 2n ? 5 and |e| ? 3n ? 6 Proof: Easy Case Voronoi diagrams have linear complexity |v|, |e| O n Claim: For n ? 3, |v| ? 2n ? 5 and |e| ? 3n ? 6 Proof: General Case Euler’s Formula: for connected, planar graphs,|v| – |e| + f 2 Where: |v| is the number