arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.01513cs.CGcs.GR
收藏

Propagate and Pair:Reeb图中临界点对的一种单程算法

Propagate and Pair: A Single-Pass Approach to Critical Point Pairing in Reeb Graphs

Junyi Tu, Mustafa Hajij, Paul Rosen

摘要:

随着拓扑数据分析的普及,Reeb图作为一种摘要技术在大型复杂数据的分析和可视化中有了新的应用,其作用已不仅仅局限于图本身。配对临界点可以形成拓扑指纹,称为持久性图,它提供了对数据结构和噪声的洞察。虽然身体的工作解决有效计算的Reeb图是大的,对文学是有限的。在本文中,我们讨论了两种算法的方法配对的Reeb图中的临界点,首先是一个多遍的方法,其次是一个新的单遍算法,所谓的配对和配对。

英文摘要:

With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex data, whose usefulness extends beyond just the graph itself. Pairing critical points enables forming topological fingerprints, known as persistence diagrams, that provides insights into the structure and noise in data. Although the body of work addressing the efficient calculation of Reeb graphs is large, the literature on pairing is limited. In this paper, we discuss two algorithmic approaches for pairing critical points in Reeb graphs, first a multipass approach, followed by a new single-pass algorithm, called Propagate and Pair.

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

↑