Voronoi diagram


Also found in: Wikipedia.

Voronoi diagram

(mathematics, graphics)
(After G. Voronoi) For a set S of points in the Euclidean plane, the partition Vor(S) of the plane into the voronoi polygons associated with the members of S. Vor(S) is the dual of the Delaunay triangulation of S.
Mentioned in ?
References in periodicals archive ?
In order to perform population partitioning by using the Voronoi diagram, we can first compute the Voronoi diagram of points [q.
We achieved this by generating a network Voronoi diagram over the points of interest.
Recall that given a set of spatial entities (called sites, typically points), a Voronoi diagram consists of edges that are equidistant from a pair of points.
Additional Key Words and Phrases: Constrained Delaunay triangulation, Dirichlet tessellation, interpolation, Thiessen regions, Voronoi diagram
STRIPACK Fortran 77 software package that employs an incremental algorithm to construct a Delaunay triangulation and, optionally, a Voronoi diagram of a set of points (nodes) on the surface of the unit sphere.
The contributors propose an aspect-ration Voronoi diagram, an application of Procrustes distance to shape analysis of Delaunay simplexes, Voronoi random fields, and a Delaunay triangulation algorithm for fingerprint matching.
Figure 8 shows an example of such a Voronoi diagram (+ and diamond indicate players of each team; box shows the ball.
Caption: Figure 1 Example of a Voronoi Diagram Partitioning the Euclidean Plane (Where R.
A new vibrational genetic algorithm enhanced with a Voronoi diagram for path planning of autonomous UAV.
This Lloyds algorithm is based on the concept of K mean clustering algorithm and Voronoi diagram.
A Voronoi diagram is a partitioning of a space into convex polygons called Voronoi cells based on prespecified points (called seeds), such that each cell contains exactly one seed and the interior points of a cell are closer to this seed than any other ones.
We first present a method for computing ORkNN results by utilizing the pre-computed ordered order-K Voronoi diagram (OOKVD) [17], where K is the maximal possible value of k.