arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.1269cs.CGmath.COmath.GT
收藏

曲面上离散函数的最优拓扑化简

Optimal topological simplification of discrete functions on surfaces

Ulrich Bauer, Carsten Lange, Max Wardetzky

摘要:

我们解决了在给定的输入函数的给定距离δ内的曲面上的所有函数中的临界点的数量最小化的问题。这一结果是通过建立离散Morse理论和持久同调之间的联系而实现的。我们的方法完全去除了持续性小于2δ的同调噪声,建设性地证明了由二维持续同调稳定性定理给出的临界点个数下界的紧性。我们还表明,最佳的解决方案,可以在线性时间计算持久性对计算后。

英文摘要:

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance δ from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2δ, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.

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

↑