loading...
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
University of Glamorgan, Pontypridd, Wales July 09-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.104th International Symposium on Vorono ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hugo Ledoux, Delft University of Technology, the Netherlands
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D geometric computing, their implementation is still problematic in practice. In this paper, I describe a simple 3D Voronoi diagram (and Delaunay tetrahedralization) algorithm, and I explain, by giving as many details and insights as possible, how to ensure that it outputs a correct structure, regardless of the spatial distribution of the points in the input.
Citation:
Hugo Ledoux, "Computing the 3D Voronoi Diagram Robustly: An Easy Explanation," isvd, pp.117-129, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.