Delaunay Triangulation of Manifolds - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Foundations of Computational Mathematics Year : 2017

Delaunay Triangulation of Manifolds

Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 935453
Ramsay Dyer
  • Function : Author
  • PersonId : 947704

Abstract

We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact manifold, a manifold Delaunay complex is produced for a perturbed point set provided the transition functions are bi-Lipschitz with a constant close to 1, and the original sample points meet a local density requirement; no smoothness assumptions are required. If the transition functions are smooth, the output is a triangulation of the manifold. The output complex is naturally endowed with a piecewise flat metric which, when the original manifold is Riemannian, is a close approximation of the original Riemannian metric. In this case the output complex is also a Delaunay triangulation of its vertices with respect to this piecewise flat metric.
Fichier principal
Vignette du fichier
manmesh.pdf (445.32 Ko) Télécharger le fichier
Vignette du fichier
star2.png (12.81 Ko) Télécharger le fichier
Vignette du fichier
star2.jpg (6.17 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01509888 , version 1 (18-04-2017)

Identifiers

Cite

Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh. Delaunay Triangulation of Manifolds. Foundations of Computational Mathematics, 2017, 45, pp.38. ⟨10.1007/s10208-017-9344-1⟩. ⟨hal-01509888⟩
369 View
746 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More