arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.15902cs.CGmath.AT
收藏

点云上函数的 Delaunay 双过滤

Delaunay Bifiltrations of Functions on Point Clouds

Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick

AI总结:

本文提出点云上函数的 Delaunay 双过滤,证明其拓扑等价性,并给出基于 Bowyer-Watson 算法和 CGAL 的高效实现,可快速处理高维点云数据。

摘要:

点云 $X\subset \mathbb{R}^d$ 的 Delaunay 过滤 $\mathcal{D}_{\bullet}(X)$ 是计算拓扑的核心工具。其使用由 $\mathcal{D}_{\bullet}(X)$ 与 $X$ 的偏移(即球的并集)过滤的拓扑等价性所证明。给定函数 $γ: X \to \mathbb{R}$,我们引入 Delaunay 双过滤 $\mathcal{DC}_{\bullet}(γ)$,满足类似的拓扑等价性,确保 $\mathcal{DC}_{\bullet}(γ)$ 在拓扑上编码 $γ$ 所有下水平集的偏移过滤及它们之间的拓扑关系。$\mathcal{DC}_{\bullet}(γ)$ 大小为 $O(|X|^{\lceil\frac{d+1}{2}\rceil})$,当 $d$ 为奇数时与 $\mathcal{D}_{\bullet}(X)$ 最坏情况大小匹配。改编计算 Delaunay 三角剖分的 Bowyer-Watson 算法,我们给出计算 $\mathcal{DC}_{\bullet}(γ)$ 的简单实用算法,时间为 $O(|X|^{\lceil \frac{d}{2}\rceil +1})$。基于 CGAL 的实现计算 $\mathcal{DC}_{\bullet}(γ)$ 相比计算 $\mathcal{D}_{\bullet}(X)$ 开销适中,几秒内处理 $\mathbb{R}^3$ 中数万个点。

英文摘要:

The Delaunay filtration $\mathcal{D}_{\bullet}(X)$ of a point cloud $X\subset \mathbb{R}^d$ is a central tool of computational topology. Its use is justified by the topological equivalence of $\mathcal{D}_{\bullet}(X)$ and the offset (i.e., union-of-balls) filtration of $X$. Given a function $γ: X \to \mathbb{R}$, we introduce a Delaunay bifiltration $\mathcal{DC}_{\bullet}(γ)$ that satisfies an analogous topological equivalence, ensuring that $\mathcal{DC}_{\bullet}(γ)$ topologically encodes the offset filtrations of all sublevel sets of $γ$, as well as the topological relations between them. $\mathcal{DC}_{\bullet}(γ)$ is of size $O(|X|^{\lceil\frac{d+1}{2}\rceil})$, which for $d$ odd matches the worst-case size of $\mathcal{D}_{\bullet}(X)$. Adapting the Bowyer-Watson algorithm for computing Delaunay triangulations, we give a simple, practical algorithm to compute $\mathcal{DC}_{\bullet}(γ)$ in time $O(|X|^{\lceil \frac{d}{2}\rceil +1})$. Our implementation, based on CGAL, computes $\mathcal{DC}_{\bullet}(γ)$ with modest overhead compared to computing $\mathcal{D}_{\bullet}(X)$, and handles tens of thousands of points in $\mathbb{R}^3$ within seconds.

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

↑