arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.07955cs.CG
收藏

双变量计算拓扑的鲁棒几何谓词

Robust Geometric Predicates for Bivariate Computational Topology

Scientific Visualization Group, Department of Science;Technology (ITN), Link\"oping University, Norrk\"oping, Sweden

Petar Hristov, Ingrid Hotz, Talha Bin Masood

AI总结:

本文提出利用精确算术与符号扰动方案,实现双变量雅可比集和Reeb空间算法的鲁棒几何谓词,并开发自动评估大型符号多项式的方法,提供实现与效率评估。

摘要:

我们提出了双变量雅可比集和Reeb空间算法的鲁棒实现的理论与实践。鲁棒性是计算几何中的一个基本主题,处理算法实现中的数值误差和退化情况问题。计算拓扑已经使用了一些鲁棒性技术来开发标量场算法,例如用于计算临界点、合并树、轮廓树、Reeb图、Morse-Smale复形和持续同调的算法。在大多数情况下,可以使用浮点运算确保鲁棒性,并且可以通过称为“模拟简单性”的标准符号扰动技术解决退化情况。然而,对于多场拓扑数据结构(如雅可比集和Reeb空间),这变得复杂得多。其计算中使用的几何谓词需要精确算术和对退化情况的更复杂处理以确保正确性。这两个挑战迄今为止在文献中尚未得到完全解决。在本文中,我们描述了如何使用精确算术和符号扰动方案来实现双变量雅可比集和Reeb空间算法的鲁棒实现。在此过程中,我们开发了一种自动评估可表示为大型符号多项式的谓词的方法,这些多项式难以像计算几何文献中通常所做的那样手工适当分解。我们提供了所有提出方法的实现并评估了其效率。

英文摘要:

We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals with the issues of numerical errors and degenerate cases in algorithm implementations. Computational topology already uses some robustness techniques for the development of scalar field algorithms, such as those for computing critical points, merge trees, contour trees, Reeb graphs, Morse-Smale complexes, and persistent homology. In most cases, robustness can be ensured with floating-point arithmetic, and degenerate cases can be resolved with a standard symbolic perturbation technique called Simulation of Simplicity. However, this becomes much more complex for topological data structures of multifields, such as Jacobi sets and Reeb spaces. The geometric predicates used in their computation require exact arithmetic and a more involved treatment of degenerate cases to ensure correctness. Neither of these challenges has been fully addressed in the literature so far. In this paper, we describe how exact arithmetic and symbolic perturbation schemes can be used to enable robust implementations of bivariate Jacobi set and Reeb space algorithms. In the process, we develop a method for automatically evaluating predicates that can be expressed as large symbolic polynomials, which are difficult to factor appropriately by hand, as is typically done in the computational geometry literature. We provide implementations of all proposed approaches and evaluate their efficiency.

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

↑