An output-sensitive algorithm for persistent homology
From MaRDI portal
Publication:1940704
DOI10.1016/j.comgeo.2012.02.010zbMath1264.65023WikidataQ59442775 ScholiaQ59442775MaRDI QIDQ1940704
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
symbolic computation; persistent homology; computational topology; worst-case time complexity; rank computation
68W30: Symbolic computation and algebraic computation
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65Y20: Complexity and performance of numerical algorithms
Related Items
Uses Software