论文标题
计算持续图束
Computing Persistence Diagram Bundles
论文作者
论文摘要
引入了持续图（PD）捆绑包（PD）捆绑包（葡萄园的概括），是一种研究由拓扑空间$ b $参数参数的一组过滤的持续同源性的一种方式。在本文中，我们提出了一种用于计算分段线性PD捆绑包的算法，这是一个宽类，其中包括许多人在实践中可能会遇到的许多PD捆绑包。给出了$ b $是三角形表面的情况的全部详细信息，我们概述了对更高维度和其他情况的概括。
Persistence diagram (PD) bundles, a generalization of vineyards, were introduced as a way to study the persistent homology of a set of filtrations parameterized by a topological space $B$. In this paper, we present an algorithm for computing piecewise-linear PD bundles, a wide class that includes many of the PD bundles that one may encounter in practice. Full details are given for the case in which $B$ is a triangulated surface, and we outline the generalization to higher dimensions and other cases.
