Skip to Main content Skip to Navigation
Conference papers

The Compressed Annotation Matrix : an Efficient Data Structure for Computing Persistent Cohomology

Jean-Daniel Boissonnat 1 Tamal K. Dey 2 Clément Maria 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : Persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices. We separate the representation of the simplicial complex from the representation of the cohomology groups, and introduce a new data structure for maintaining the annotation matrix, which is more compact and reduces substancially the amount of matrix operations. In addition, we propose a heuristic to simplify further the representation of the cohomology groups and improve both time and space complexities. The paper provides a theoretical analysis, as well as a detailed experimental study of our implementation and comparison with state-of-the-art software for persistent homology and cohomology.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Thursday, January 2, 2014 - 1:49:06 PM
Last modification on : Saturday, January 27, 2018 - 1:31:27 AM
Long-term archiving on: : Saturday, April 8, 2017 - 10:01:29 AM


Files produced by the author(s)




Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria. The Compressed Annotation Matrix : an Efficient Data Structure for Computing Persistent Cohomology. ESA - European Symposium on Algorithms - 2013, Sep 2013, Sophia Antipolis, France. pp.695-706, ⟨10.1007/978-3-642-40450-4_59⟩. ⟨hal-00923325⟩



Record views


Files downloads