Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast Persistent Homology Computation for Functions on R\mathbb{R}

Published 11 Jan 2023 in cs.CG and math.AT | (2301.04745v2)

Abstract: 0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of nn edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the connected components and we get the persistence diagram in time O(nα(n))O(n\alpha(n)). The running time is thus usually dominated by sorting the edges in Θ(nlog⁡(n))\Theta(n\log(n)). A little-known fact is that, in the particularly simple case of studying the sublevel sets of a piecewise-linear function on R\mathbb{R} or S1\mathbb{S}^1, persistence can actually be computed in linear time. This note presents a simple algorithm that achieves this complexity and an extension to image persistence. An implementation is available in Gudhi.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.