Abstract
AbstractThe construction of Voronoi diagrams has two main aspects: The construction algorithm and the data structure. For the construction of planar Voronoi diagrams e.g. the well known plane sweep algorithm can be applied. Another efficient method is the incremental construction of the Delaunay triangulation by using the quad‐edge data structure. Within this data structure the Delaunay triangulation is treated as a planar graph. Incremental construction implies that manipulations of the triangulation are allowed. Its Voronoi diagram is obtained simply by accessing the triangulation's dual graph. We extend this method to tree dimensions, by implementing a 3D Delaunay triangulation on the facet‐edge data structure. (© 2010 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have