Voronoi cells

From SklogWiki
Jump to navigation Jump to search

A Voronoi cell [1](also known as: Voronoi polyhedra, Voronoi tessellations, Dirichlet tesselations, Wigner-Seitz cells) is the diagram that results when a cell is defined around each of the points (or nodes, or vertices) of a network with the following criterion: each point in the cell is closer to its node than to any of the others. This very intuitive partition of space results in the Voronoi tessellation. The typical example is to, e.g., assign areas of a country to different fire stations, so that if a fire occurs, the corresponding station is the closest one.

Voronoi cells are dual of Delaunay simplexes.



Related reading

External links and resources[edit]