pith. sign in

arxiv: 1311.0117 · v2 · pith:KOZD74HNnew · submitted 2013-11-01 · 💻 cs.CG

Delaunay triangulation of manifolds

classification 💻 cs.CG
keywords delaunaymanifoldcomplexmanifoldsmetrictriangulationalgorithmclose
0
0 comments X
read the original 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 provided the transition functions are bi-Lipschitz with a constant close to 1, and the 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 ouput complex is also a Delaunay triangulation of its vertices with respect to this piecewise flat metric.

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.