Delaunay triangulation of manifolds (Q1750387): Difference between revisions

This paper is part of a series devoted to reconstruction and triangulation of manifolds from a finite sample [\textit{J.-D. Boissonnat} et al., Int. J. Comput. Geom. Appl. 24, No. 2, 125--152 (2014; Zbl 1319.68226); Comput. Geom. 66, 32--67 (2017; Zbl 1387.68243); Discrete Comput. Geom. 59, No. 1, 226--237 (2018 Zbl 1384.52013)]. The input of the presented algorithm is a set of points in a suitable atlas of a given manifold. The conditions are reasonable and very carefully stated. By playing on a (far from trivial) perturbation of points, a new set free from ``forbidden configurations'' is obtained. A Delaunay simplicial complex is built; if the given manifold is Riemannian, a natural homeomorphism with the complex is granted. The algorithm and the properties are described in extreme detail.