Published November 2002
| Version v1
Report
Perturbations and Vertex Removal in a 3D Delaunay Triangulation
- Creators
- Devillers, Olivier
- Teillaud, Monique
- Others:
- Geometry, algebra, algorithms (GALAAD) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)
- Geometry, Algorithms and Robotics (PRISME) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- INRIA
Description
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in practice. We propose a simple method that allows to remove any vertex even when the points are in very degenerate configurations. The solution is available in \cgal\footnote{\texttt- {http://www.cgal.org} (releases 2.3 and 2.4)}.
Additional details
- URL
- https://hal.inria.fr/inria-00071961
- URN
- urn:oai:HAL:inria-00071961v1
- Origin repository
- UNICA