Voronoi diagram - Revision history

Karl Jones: /* See also */

2016-05-27T22:29:59Z

‎See also

Karl Jones at 22:01, 27 May 2016

2016-05-27T22:01:05Z

Karl Jones: 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..."

2016-05-27T21:58:15Z

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..."

New page

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 ==

* [https://en.wikipedia.org/wiki/Voronoi_diagram Voronoi diagram] @ Wikipedia

[[Category:Mathematics]]

← Older revision		Revision as of 22:29, 27 May 2016
Line 14:		Line 14:

	== See also ==		== See also ==
		+
		+	* [[Centroidal Voronoi tessellation]]
		+	* [[Computational geometry]]
		+	* [[Delaunay triangulation]]
		+	* [[Map segmentation]]
		+	* [[Mathematical diagram]]
		+	* [[Mathematics]]
		+	* [[Natural neighbor interpolation]]
		+	* [[Nearest neighbor search]]
		+	* [[Nearest-neighbor interpolation]]
		+	* [[Power diagram]]
		+	* [[Voronoi pole]]

	== External links ==		== External links ==

← Older revision		Revision as of 22:01, 27 May 2016
Line 1:		Line 1:
−	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.	+	[[File:Approximate Voronoi Diagram.svg.png\|thumb\|Approximate Voronoi diagram of a set of points. Notice the blended colors in the fuzzy boundary of the Voronoi cells.]]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.		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.