arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.01947cs.CG
收藏

稀疏Delaunay滤波

A Sparse Delaunay Filtration

Donald R. Sheehy

摘要:

我们展示了如何过滤的Delaunay复合物可以用来近似持久性图的距离在$R^d$的点集。尽管完整的Delaunay复形可以用来精确地计算这个持久性图,但它的大小可能是$O(n^{\lceil d/2 \rceil})$。相比之下,我们的构造仅使用$O(n)$单纯形。其中心思想是通过将增量构造中的翻转视为$d+1$维中的单形,来连接逐渐密集的子样本上的Delaunay复形。这种方法导致了一个非常简单和直接的证明几何方面的正确性,因为最终的过滤是对偶的$(d+1)$维Voronoi建设类似于标准的Delaunay过滤复杂。我们还展示了如何有效地构建这种复杂的。

英文摘要:

We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in $R^d$. Whereas the full Delaunay complex can be used to compute this persistence diagram exactly, it may have size $O(n^{\lceil d/2 \rceil})$. In contrast, our construction uses only $O(n)$ simplices. The central idea is to connect Delaunay complexes on progressively denser subsamples by considering the flips in an incremental construction as simplices in $d+1$ dimensions. This approach leads to a very simple and straightforward proof of correctness in geometric terms, because the final filtration is dual to a $(d+1)$-dimensional Voronoi construction similar to the standard Delaunay filtration complex. We also, show how this complex can be efficiently constructed.

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

↑