Journal
DISCRETE & COMPUTATIONAL GEOMETRY
Volume 59, Issue 1, Pages 226-237Publisher
SPRINGER
DOI: 10.1007/s00454-017-9908-5
Keywords
Delaunay complex; Triangulation; Riemannian manifold
Categories
Funding
- 7th Framework Programme for Research of the European Commission [255827]
- European Research Council GUDHI (Geometric Understanding in Higher Dimensions)
- Ramanujan Fellowship [SB/S2/RJN-064/2015]
- IndoGerman Max Planck Center for Computer Science (IMPECS)
Ask authors/readers for more resources
Delaunay has shown that the Delaunay complex of a finite set of points of Euclidean space triangulates the convex hull of provided that satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay's genericity assumption no longer guarantees that the Delaunay complex will yield a triangulation; stronger assumptions on are required. A natural one is to assume that is sufficiently dense. Although results in this direction have been claimed, we show that sample density alone is insufficient to ensure that the Delaunay complex triangulates a manifold of dimension greater than 2.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available