Voronoi Diagrams and Delaunay Triangulations
نویسنده
چکیده
The Voronoi diagram of a set of sites partitions space into regions one per site the region for a site s consists of all points closer to s than to any other site The dual of the Voronoi diagram the Delaunay triangulation is the unique triangulation so that the circumsphere of every triangle contains no sites in its interior Voronoi diagrams and Delaunay triangulations have been rediscovered or applied in many areas of math ematics and the natural sciences they are central topics in computational geometry with hundreds of papers discussing algorithms and extensions Section discusses the de nition and basic properties in the usual case of point sites in R with the Euclidean metric while section gives basic algorithms Some of the many extensions obtained by varying metric sites environment and constraints are discussed in section Section nishes with some interesting and nonobvious structural properties of Voronoi diagrams and Delaunay triangulations
منابع مشابه
Hyperbolic Delaunay triangulations and Voronoi diagrams made practical
We show how to compute Delaunay triangulations and Voronoi diagrams of a set of points in hyperbolic space in a very simple way. While the algorithm follows from [7], we elaborate on arithmetic issues, observing that only rational computations are needed. This allows an exact and efficient implementation.
متن کاملVector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations
We introduce a weighting scheme for Voronoi diagrams that has preferred directions. This generalizes the concept of weighted Delaunay triangulations and overcomes some of the difficulties of using multiplicative anisotropic weight systems. We discuss properties that make these weighting schemes attractive.
متن کاملMultiple Covers with Balls II: Weighted Averages
Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voro...
متن کاملComputing Delaunay Triangulations in Manhattan and Maximum Metric
We modify the incremental algorithm for computing Voronoi diagrams in the Euclidean metric proposed by Ohya, Iri and Murota 6] in order to obtain an algorithm for computing Voronoi diagrams (resp. Delaunay triangulations) in Man-hattan and Maximum metric, that is rather simply to implement. We generalize the notions of \Voronoi diagram" and \Delaunay triangulation" in such a way that these stru...
متن کاملay 2 00 8 Notes on Convex Sets , Polytopes , Polyhedra Combinatorial Topology , Voronoi Diagrams and Delaunay Triangulations
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...
متن کامل