Title

Only distances are required to reconstruct submanifolds

Article Type

Research Article

Publication Title

Computational Geometry: Theory and Applications

Abstract

In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold of Euclidean space without maintaining or even constructing complicated data structures such as Voronoi diagrams or Delaunay complexes. Our algorithm uses the witness complex and relies on the stability of power protection, a notion introduced in this paper. The complexity of the algorithm depends exponentially on the intrinsic dimension of the manifold, rather than the dimension of ambient space, and linearly on the dimension of the ambient space. Another interesting feature of this work is that no explicit coordinates of the points in the point sample is needed. The algorithm only needs the distance matrix as input, i.e., only distance between points in the point sample as input.

First Page

32

Last Page

67

DOI

10.1016/j.comgeo.2017.08.001

Publication Date

12-1-2017

Comments

Open Access, Bronze, Green

This document is currently not available here.

Share

COinS