Elsevier

Computational Geometry

Volume 44, Issue 3, April 2011, Pages 160-168
Computational Geometry

Perturbations for Delaunay and weighted Delaunay 3D triangulations

https://doi.org/10.1016/j.comgeo.2010.09.010Get rights and content
Under an Elsevier user license
open archive

Abstract

The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code. It is implemented in cgal, and guarantees that both vertex insertion and vertex removal are fully robust.

Keywords

3D weighted Delaunay triangulation
Robustness
Symbolic perturbation
Degenerate cases

Cited by (0)