pith. sign in

arxiv: 1612.02905 · v1 · pith:4FXHCI3Enew · submitted 2016-12-09 · 💻 cs.CG · math.DG· math.GT

An obstruction to Delaunay triangulations in Riemannian manifolds

classification 💻 cs.CG math.DGmath.GT
keywords delaunaycomplexgenericitymanifoldsriemanniantriangulatesalonealthough
0
0 comments X
read the original abstract

Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ 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 $P$ are required. A natural one is to assume that $P$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.