Computing the 3D Voronoi Diagram Robustly: An Easy Explanation

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.

• Type: Conference
• Year: 2007
• Where: ISVD
• Authors: Hugo Ledoux
• Keywords: ISVD 2007, Many Algorithms, Simple 3d Voronoi, Theoretical Computer Science, Voronoi Diagram