Skip to main content icon/video/no-internet

The Voronoi diagram (also called a Dirichlet tessellation or a set of Thiessen polygons) is a partition of a metric space such that we associate all locations in that space with the closest object in that space, based on the specified metric. Thus, each object is the generator of a cell or tile, and the set of tiles covers the space or map.

In the simplest case, we are given a set of points S in the Euclidean plane, which are the Voronoi generators. Each generator, s, has a Voronoi cell, V(s), consisting of all points closer to s than to any other generator. The cell boundaries of the Voronoi diagram are all the points in the plane that are equidistant to two generators, and the Voronoi nodes are the points equidistant to three (or more) generators. Voronoi cells can be defined for metrics other than Euclidean, such as the Manhattan distance, and for other surfaces than the plane, such as the sphere. Voronoi cells can also be defined by measuring distances to objects that are not points. The dual graph of the Voronoi diagram of S corresponds to the Delaunay triangulation (DT) of S (Figure 1). Here, all Voronoi cells have generators that form the vertices of the DT, all Voronoi edges have perpendicular Delaunay edges, and all Voronoi vertices are the centers of the circumcircles of the DT.

Figure 1 The Voronoi diagram of a set of points, together with the dual Delaunay triangulation

None
Source: Author.

The idea of the Voronoi diagram is relevant in many spatial sciences, giving descriptions of proximity, adjacency, clustering, territoriality, and others. The DT is widely used as a stable and well-defined triangulation for terrain modeling. Informal use of Voronoi diagrams can be traced back to Descartes in 1644. The Voronoi diagram was used in 1854 by the British physician John Snow to show that the majority of people who died during the cholera epidemic in the Soho district of London lived closer to the contaminated pump at Broad Street than to any other source of water.

Properties

Given a set of service locations (e.g., post offices), the Voronoi diagram identifies the closest service to any particular location. The location furthest from any point in S is one of the vertices of the Voronoi diagram of S. This has the largest possible empty circle within the map. This is equivalent to the triangle in the DT of S with the largest circumcircle. Every triangle in the DT has an empty circumcircle. Equivalently, every edge in a DT has an empty circle touching the two ends. Given a set of n points in S, the closest pair of points will be on an edge of the DT of S. Similarly, the nearest neighbor to each of a set of points will be defined by an edge of the DT of S. The Euclidean minimum spanning tree of a set of points S is a graph without any cycles that connects all points in S with a minimum total edge length. It is a subset of the edges of the DT of S. The DT is a planar graph. By Euler's formula, it has at most 3n–6 edges and at most 2n–5 triangles. The convex hull of S is a subset of the edges of the DT. The DT maximizes the minimum angle of each triangle by comparing it with its neighbors. This approach gives the fattest triangles possible for the set S (Figure 2).

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading