奇异安排与遍历算法用于计算双变量分段线性映射的Reeb空间
Singular Arrange and Traverse Algorithm for Computing Reeb Spaces of Bivariate PL Maps
AI总结:
本文提出一种基于安排与遍历框架的新型算法,用于高效计算双变量分段线性映射的Reeb空间,显著提升了计算效率。
摘要:
我们提出了一种精确且高效的算法来计算双变量分段线性映射的Reeb空间。Reeb空间是一种拓扑结构,它将Reeb图推广到多个标量值函数在共享域上定义的情况,这种情况在实际应用中经常出现。虽然Reeb图已成为计算机图形学、形状分析和科学可视化中的标准工具,但Reeb空间仍处于早期应用阶段。尽管已经提出了几种计算Reeb空间的算法,但没有一个算法提供既精确又高效的实现,这在很大程度上限制了其实际应用。为了解决这一差距,我们引入了奇异安排与遍历算法,这是一种基于安排与遍历框架的新算法。我们的方法利用了双变量情况下,只有奇异边对Reeb空间的结构有贡献,从而可以忽略许多常规边。这一观察结果在大多数边为常规的的数据集上带来了显著的效率提升,这在许多物理系统的数值模拟中很常见。我们提供了该方法的实现,并将其与原始安排与遍历算法进行基准测试,显示在真实世界数据集上性能提升了多达四个数量级。
英文摘要:
We present an exact and efficient algorithm for computing the Reeb space of a bivariate PL map. The Reeb space is a topological structure that generalizes the Reeb graph to the setting of multiple scalar-valued functions defined over a shared domain, a situation that frequently arises in practical applications. While the Reeb graph has become a standard tool in computer graphics, shape analysis, and scientific visualization, the Reeb space is still in the early stages of adoption. Although several algorithms for computing the Reeb space have been proposed, none offer an implementation that is both exact and efficient, which has substantially limited its practical use. To address this gap, we introduce singular arrange and traverse, a new algorithm built upon the arrange and traverse framework. Our method exploits the fact that, in the bivariate case, only singular edges contribute to the structure of Reeb space, allowing us to ignore many regular edges. This observation results in substantial efficiency gains on datasets where most edges are regular, which is common in many numerical simulations of physical systems. We provide an implementation of our method and benchmark it against the original arrange and traverse algorithm, showing performance gains of up to four orders of magnitude on real-world datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。