Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data

IF 0.6 3区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Sushovan Majhi
{"title":"Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data","authors":"Sushovan Majhi","doi":"10.1007/s00454-024-00655-9","DOIUrl":null,"url":null,"abstract":"<p>For a closed Riemannian manifold <span>\\(\\mathcal {M}\\)</span> and a metric space <i>S</i> with a small Gromov–Hausdorff distance to it, Latschev’s theorem guarantees the existence of a sufficiently small scale <span>\\(\\beta &gt;0\\)</span> at which the Vietoris–Rips complex of <i>S</i> is homotopy equivalent to <span>\\(\\mathcal {M}\\)</span>. Despite being regarded as a stepping stone to the topological reconstruction of Riemannian manifolds from noisy data, the result is only a qualitative guarantee. Until now, it had been elusive how to quantitatively choose such a proximity scale <span>\\(\\beta \\)</span> in order to provide sampling conditions for <i>S</i> to be homotopy equivalent to <span>\\(\\mathcal {M}\\)</span>. In this paper, we prove a stronger and pragmatic version of Latschev’s theorem, facilitating a simple description of <span>\\(\\beta \\)</span> using the sectional curvatures and convexity radius of <span>\\(\\mathcal {M}\\)</span> as the sampling parameters. Our study also delves into the topological recovery of a closed Euclidean submanifold from the Vietoris–Rips complexes of a Hausdorff close Euclidean subset. As already known for Čech complexes, we show that Vietoris–Rips complexes also provide topologically faithful reconstruction guarantees for submanifolds.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"24 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00655-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

For a closed Riemannian manifold \(\mathcal {M}\) and a metric space S with a small Gromov–Hausdorff distance to it, Latschev’s theorem guarantees the existence of a sufficiently small scale \(\beta >0\) at which the Vietoris–Rips complex of S is homotopy equivalent to \(\mathcal {M}\). Despite being regarded as a stepping stone to the topological reconstruction of Riemannian manifolds from noisy data, the result is only a qualitative guarantee. Until now, it had been elusive how to quantitatively choose such a proximity scale \(\beta \) in order to provide sampling conditions for S to be homotopy equivalent to \(\mathcal {M}\). In this paper, we prove a stronger and pragmatic version of Latschev’s theorem, facilitating a simple description of \(\beta \) using the sectional curvatures and convexity radius of \(\mathcal {M}\) as the sampling parameters. Our study also delves into the topological recovery of a closed Euclidean submanifold from the Vietoris–Rips complexes of a Hausdorff close Euclidean subset. As already known for Čech complexes, we show that Vietoris–Rips complexes also provide topologically faithful reconstruction guarantees for submanifolds.

Abstract Image

揭开拉切夫定理的神秘面纱:从噪声数据中重构流形
对于一个封闭的黎曼流形(\mathcal {M}\)和一个与之有很小的格罗莫夫-豪斯多夫距离的度量空间S,拉茨切夫定理保证存在一个足够小的尺度(\beta >0\),在这个尺度上,S的Vietoris-Rips复数与\(\mathcal {M}\)同调等价。尽管这一结果被视为从噪声数据中重建黎曼流形拓扑的垫脚石,但它只是一个定性的保证。直到现在,如何定量地选择这样一个接近尺度(\beta \),从而为 S 提供与 \(\mathcal {M}\)同调等价的采样条件,一直是个难题。在本文中,我们证明了 Latschev 定理的一个更强、更实用的版本,便于使用 \(\mathcal {M}\) 的截面曲率和凸半径作为采样参数来简单描述 \(beta \)。我们的研究还深入探讨了从 Hausdorff close 欧几里得子集的 Vietoris-Rips 复数中恢复封闭欧几里得子平面的拓扑。正如对 Čech 复数已经知道的那样,我们证明 Vietoris-Rips 复数也能为子实体提供拓扑忠实重构保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete & Computational Geometry
Discrete & Computational Geometry 数学-计算机:理论方法
CiteScore
1.80
自引率
12.50%
发文量
99
审稿时长
6-12 weeks
期刊介绍: Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信