Voronoi.ppt.pptVIP

Voronoi Diagrams The Voronoi Diagram Voronoi Regions Example Computing the Voronoi Diagram Animations of the Voronoi diagram Characteristics of Voronoi Diagrams Vor(P) is Connected Other Characteristics (Assumption: No 4 points are on the circle) Size and Storage Size of the Voronoi Diagram Proof(Continued) Example Storage of Voronoi-Diagrams Computing the Voronoi Diagram Divide and Conquer(Divide) Divide and Conquer (Conquer) Divide and Conquer (Merge) The Result Geometrical Divide and Conquer DAC - Construction of the Voronoi diagram Computation of K Example Fortune′s Algorithm Applications 1(Static Point Set) Applications (dynamic object set) Computational Geometry Prof. Dr. Th. Ottmann Definition Characteristics Size and Storage Construction Use Eucledian distance : dist(p,q) := Let P :={ p1, p2, ...,pn } be a set of n distinct points in a plane.We define the voronoi diagram of P as the subdivision of the planeinto n cells, with the property that a point q lies in the cell correspon-ding to a site pi iff dist(q, pi ) dist(q, pj ) for each pj ? P with j ? i. We denote the Voronoi diagram of P by Vor(P).The cell that corresponds to a site pi is denotd by V(pi ), called thevoronoi cell of pi. V(pi) = ?1? j ? n, j ? i h(pi, pj) q4 q1 q3 q2 p Input: A set of points (sites) Output: A partitioning of the plane into regions of equal nearest neighbors Java Applet zur Animation von Voronoi Diagrammen, Entwickelt von R. Klein u.a., FU Hagen pi V(pi) (1) Voronoi regions (cells) are bounded by line segments. Special case : Collinear points Theorem : Let P be a set of n points (sites) in the plane. If all the sites are collinear, then Vor(P) consist of n-1 parallel lines and n cells. Otherwise, Vor(P) is a connected graph and its edges are either line segments or half-lines. e pi pj pk h(pi,pj) h(pj,pk) If pi, pj are not collinear with pk, thenh(pi, pj ) and h(pj, pk ) can not be parallel! If Vor(P) is not connected then there would be a Voronoicel