Decomposing filtered chain complexes: Geometry behind barcoding algorithms
Authors:
- Wojciech ChachólskiWCWojciech Chachólski
- Barbara GiuntiBGBarbara Giunti
- Alvin JinAJAlvin Jin
- Claudia LandiCLClaudia Landi
Open Access
- 31 August 2022
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 109
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Phat – Persistent Homology Algorithms ToolboxJournal of Symbolic Computation, 2017
- Persistence Modules on Commutative Ladders of Finite TypeDiscrete & Computational Geometry, 2015
- Persistent homology analysis of protein structure, flexibility, and foldingInternational Journal for Numerical Methods in Biomedical Engineering, 2014
- Dualities in persistent (co)homologyInverse Problems, 2011
- Zigzag PersistenceFoundations of Computational Mathematics, 2010
- Topology and dataBulletin of the American Mathematical Society, 2009
- Computing Persistent HomologyDiscrete & Computational Geometry, 2004
- Topological Persistence and SimplificationDiscrete & Computational Geometry, 2002
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphereComputer Aided Geometric Design, 1995
- On the use of size functions for shape analysisBiological Cybernetics, 1993