| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414269 | Computational Geometry | 2011 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
