Voronoi diagram

(redirected from Voronoi diagrams)

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 ?
To this end she applies to her data various 'classic' locational models, now available as standard within Geographical Information Systems: Central Place Theory, weighted Voronoi diagrams (Thiessen polygons) and the application of Rank-size analysis.
Spatial tessellations: Concepts and applications of Voronoi diagrams (2nd ed.
On the number of faces in higher-dimensional Voronoi diagrams.
Voronoi diagrams can illustrate the structure of gravitational fields in the universe, the spread of animals in their habitats, interference patterns of waves on an otherwise quiet pond, the deep structure of matter, and other aspects of creation.
Case studies show that how the generalized Voronoi diagrams and clustering can be combined and used with user-oriented datasets available through Web 2.
The set of neighboring known heights together with their respective weights are well-governed by Voronoi diagrams.
Spatial tessellations--Concepts and applications of Voronoi diagrams, 2nd ed.
Another method of calculation of reference spheres is to apply computational geometry techniques, which frequently make use of the so-called Voronoi diagrams (see Samuel & Shunmugam, 2002, and Huang, 1999).
Voronoi diagrams in science and engineering; proceedings.
Geometric shapes such as Voronoi diagrams and Delaunay triangles have been used for site characterization in environmental science [4].
In our simulation, the service area is represented by a rectangle with a fixed size of 4000' 4000 Scope distributions of the data items are generated based on Voronoi Diagrams [14, 19,17].
Providing readers to an extensive guide to the sciences, definitions, properties, algorithms, and examples of Quadtrees, Orthogonal Windowing and Stabbing Queries, BSP Trees, Bounding Volume Hierarchies, Distance Fields, Voronoi Diagrams, and Geometric Proximity Graphs, as well as a knowledgeable reference of using the existing kinetic, robust, and dynamic data structures.