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

计算多重覆盖双过滤

Computing the Multicover Bifiltration

René Corbet, Michael Kerber, Michael Lesnick, Georg Osang

摘要:

给定有限集合$A\subset\mathbb{R}^d$,设Cov $_{r,k}$表示距离$r$至少$A$的$k$点的所有点的集合。允许$r$和$k$变化,我们得到了一个2参数的空间,当$r$增加或$k$减少时,它会变大,称为\emph{multicover bifiltration}。出于这个双滤的计算同源性的问题,我们引入了两个密切相关的组合双滤,一个多面体和其他单纯,这都是拓扑等价的多覆盖双滤和远小于\v Cech为基础的模型考虑在以前的工作Sheehy。我们的多面体建设是一个bifiltration的菱形平铺的Edelsbrunner和Osang,并可以有效地计算使用这些作者给出的算法的变体。使用尺寸2和3的实现,我们提供了实验结果。我们的单纯构造对于理解多面体构造和证明其正确性是有用的。

英文摘要:

Given a finite set $A\subset\mathbb{R}^d$, let Cov$_{r,k}$ denote the set of all points within distance $r$ to at least $k$ points of $A$. Allowing $r$ and $k$ to vary, we obtain a 2-parameter family of spaces that grow larger when $r$ increases or $k$ decreases, called the \emph{multicover bifiltration}. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a \v Cech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness.

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

↑