arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.7012cs.CG
收藏

只需要距离就可以重构子流形

Only distances are required to reconstruct submanifolds

Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Steve Y. Oudot

摘要:

在本文中,我们给出了第一个算法,输出一个忠实的重建的一个子流形的欧氏空间,而无需维护,甚至构建复杂的数据结构,如沃罗诺伊图或Delaunay复形。我们的算法使用证人复杂,并依赖于稳定的电源保护,本文介绍的概念。该算法的复杂度指数依赖于流形的内在维数,而不是周围空间的维数,线性依赖于周围空间的维数。这项工作的另一个有趣的特点是,不需要点样本中的点的显式坐标。该算法只需要距离矩阵作为输入,即,仅将点样本中的点之间的距离作为输入。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑