Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Only Distances are Required to Reconstruct Submanifolds


Ghosh,  Arijit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Preprint), 563KB

Supplementary Material (public)
There is no public supplementary material available

Boissonnat, J.-D., Dyer, R., Ghosh, A., & Oudot, S. Y. (2014). Only Distances are Required to Reconstruct Submanifolds. Retrieved from http://arxiv.org/abs/1410.7012.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4810-3
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.