2000 character limit reached
Computing Persistence Diagram Bundles
Published 12 Oct 2022 in math.AT and cs.CG | (2210.06424v2)
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 $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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.