# Constructing Intrinsic Delaunay Triangulations of Submanifolds

* Corresponding author
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic point sets, we establish sampling criteria which ensure that the intrinsic Delaunay complex coincides with the restricted Delaunay complex and also with the recently introduced tangential Delaunay complex. The algorithm generates a point set that meets the required criteria while the tangential complex is being constructed. In this way the computation of geodesic distances is avoided, the runtime is only linearly dependent on the ambient dimension, and the Delaunay complexes are guaranteed to be triangulations of the manifold.
Keywords :
Document type :
Reports

Cited literature [24 references]

https://hal.inria.fr/hal-00804878
Contributor : Ramsay Dyer <>
Submitted on : Tuesday, March 26, 2013 - 2:48:13 PM
Last modification on : Saturday, January 27, 2018 - 1:30:57 AM
Document(s) archivé(s) le : Sunday, April 2, 2017 - 8:30:14 PM

### Files

RR-8273.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00804878, version 1
• ARXIV : 1303.6493

### Citation

Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh. Constructing Intrinsic Delaunay Triangulations of Submanifolds. [Research Report] RR-8273, INRIA. 2013, pp.54. ⟨hal-00804878⟩

Record views