Voronoi Diagram
(Redirected from Voronoi diagram)
Jump to navigation
Jump to search
A Voronoi Diagram is an illustration of a metric space determined by distances to a specified discrete set of objects in the space.
- See: Decomposition, Visualized Graph.
References
2009
- http://en.wikipedia.org/wiki/Voronoi_diagram
- In mathematics, a Voronoi diagram is a special kind of decomposition of a metric space determined by distances to a specified discrete set of objects in the space, e.g., by a discrete set of points. It is named after Georgy Voronoi, also called a Voronoi tessellation, a Voronoi decomposition, or a Dirichlet tessellation (after Lejeune Dirichlet),
- In the simplest case, we are given a set of points [math]\displaystyle{ S }[/math] in the plane, which are the Voronoi sites. Each site [math]\displaystyle{ s }[/math] has a Voronoi cell, also called a Dirichlet cell, V(s) consisting of all points closer to [math]\displaystyle{ s }[/math] than to any other site. The segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites. The Voronoi nodes are the points equidistant to three (or more) sites.