Difference between revisions of "Voronoi diagram"
Karl Jones (Talk | contribs) (Created page with "In mathematics, a '''Voronoi diagram''' is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points (calle...") |
(No difference)
|
Revision as of 15:58, 27 May 2016
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane.
That set of points (called seeds, sites, or generators) is specified beforehand, and for each seed there is a corresponding region consisting of all points closer to that seed than to any other.
These regions are called Voronoi cells.
Description
The Voronoi diagram of a set of points is dual to its Delaunay triangulation.
It is named after Georgy Voronoi, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet).
Voronoi diagrams have practical and theoretical applications to a large number of fields, mainly in science and technology but also including visual art.
See also
External links
- Voronoi diagram @ Wikipedia
