Skip to Main content Skip to Navigation
Conference papers

Computing Persistent Homology with Various Coefficient Fields in a Single Pass

Jean-Daniel Boissonnat 1 Clément Maria 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent homological features in the diagrams for the different coefficient fields. This computation allows us to infer the prime divisors of the torsion coefficients of the integral homology groups of the topological space at any scale, hence furnishing a more informative description of topology than persistence in a single coefficient field. We provide theoretical complexity analysis as well as detailed experimental results. The code is part of the Gudhi library.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Thursday, July 10, 2014 - 4:01:44 PM
Last modification on : Saturday, January 27, 2018 - 1:30:59 AM
Long-term archiving on: : Friday, October 10, 2014 - 12:20:41 PM


Files produced by the author(s)


  • HAL Id : hal-01022669, version 1



Jean-Daniel Boissonnat, Clément Maria. Computing Persistent Homology with Various Coefficient Fields in a Single Pass. European Symposium on Algorithms, European Association for Theoretical Computer Science (EATCS), Sep 2014, Wrocław, Poland. ⟨hal-01022669⟩



Record views


Files downloads