An output-sensitive algorithm for persistent homology

DOI10.1016/j.comgeo.2012.02.010zbMath1264.65023OpenAlexW2207449046WikidataQ59442775 ScholiaQ59442775MaRDI QIDQ1940704

Chao Chen, Michael Kerber

Publication date: 7 March 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.02.010

zbMATH Keywords

symbolic computationpersistent homologycomputational topologyworst-case time complexityrank computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Barcodes of towers and a streaming algorithm for persistent homology ⋮ Distributing persistent homology via spectral sequences ⋮ The compressed annotation matrix: an efficient data structure for computing persistent cohomology ⋮ Discrete Morse theory for computing zigzag persistence ⋮ Ripser: efficient computation of Vietoris-Rips persistence barcodes ⋮ \textsc{Phat} -- persistent homology algorithms toolbox

Uses Software

• LinBox

This page was built for publication: An output-sensitive algorithm for persistent homology