(计算机图形学)Voronoi_Diagram_Slides.ppt

Computational Geometry Lecture 8 Voronoi Diagrams Voronoi Diagram Input: A set of points locations (sites) in the plane. Output: A planar subdivision into cells. Each cell contains all the points for which a certain site is the closest. Application: Nearest-neighbor queries (by point location in the diagram). Voronoi Diagram Assume no four sites are co-circular. The Voronoi diagram is a planar graph, whose vertices are equidistant from three sites, and edges equidistant from two sites. The convex hull of the sites are those who have an unbounded cell. Prove ! Voronoi Diagram – Na?ve Cons