Voronoi diagram (nonfiction): Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
No edit summary
No edit summary
Line 34: Line 34:
* [http://karljones.com/voronoi/ Voronoi experiment] @ karljones.com
* [http://karljones.com/voronoi/ Voronoi experiment] @ karljones.com
* [https://www.desmos.com/calculator/ejatebvup4 Fortune's algorithm for Voronoi diagrams]
* [https://www.desmos.com/calculator/ejatebvup4 Fortune's algorithm for Voronoi diagrams]
* [https://rosettacode.org/wiki/Voronoi_diagram Voronoi diagram code examples] @ rosettacode.org


* [https://www.cs.columbia.edu/~pblaer/projects/path_planner/ Robot Path Planning Using Generalized Voronoi Diagrams]
* [https://www.cs.columbia.edu/~pblaer/projects/path_planner/ Robot Path Planning Using Generalized Voronoi Diagrams]

Revision as of 11:41, 30 September 2018

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.

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.

In the News

Fiction cross-reference

Nonfiction cross-reference

External links: