Voronoi diagram (nonfiction): Difference between revisions
No edit summary |
|||
Line 16: | Line 16: | ||
== Fiction cross-reference == | == Fiction cross-reference == | ||
* [[Fantasy Voronoi diagram]] | |||
== External links == | == External links == |
Revision as of 16:25, 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.
Nonfiction cross-reference
Fiction cross-reference
External links
- Voronoi diagram @ wiki.karljones.com
- Voronoi diagram @ Wikipedia