Computing Persistence Diagram Bundles
Abigail Hickok

TL;DR
This paper introduces an algorithm for computing piecewise-linear persistence diagram bundles, extending the concept of vineyards to more complex parameter spaces, with detailed methods for triangulated surfaces.
Contribution
The paper presents a novel algorithm for computing piecewise-linear PD bundles, including detailed methods for triangulated surfaces and generalizations to higher dimensions.
Findings
Algorithm effectively computes PD bundles for triangulated surfaces.
Extends vineyard concepts to broader classes of parameter spaces.
Provides a framework for practical computation of complex persistent homology structures.
Abstract
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 . 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 is a triangulated surface, and we outline the generalization to higher dimensions and other cases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Data Management and Algorithms · Homotopy and Cohomology in Algebraic Topology
