Skip to Main content Skip to Navigation

Algorithms and data structures in computational topology

Clément Maria 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : The theory of homology generalizes the notion of connectivity in graphs to higher dimensions. It defines a family of groups on a domain, described discretely by a simplicial complex that captures the connected components, the holes, the cavities and higher-dimensional equivalents. In practice, the generality and flexibility of homology allows the analysis of complex data, interpreted as point clouds in metric spaces. The theory of persistent homology introduces a robust notion of homology for topology inference. Its applications are various and range from the description of high dimensional configuration spaces of complex dynamical systems, classification of shapes under deformations and learning in medical imaging. In this thesis, we explore the algorithmic ramifications of persistent homology. We first introduce the simplex tree, an efficient data structure to construct and maintain high dimensional simplicial complexes. We then present a fast implementation of persistent cohomology via the compressed annotation matrix data structure. We also refine the computation of persistence by describing ideas of homological torsion in this framework, and introduce the modular reconstruction method for computation. Finally, we present an algorithm to compute zigzag persistent homology, an algebraic generalization of persistence. To do so, we introduce new local transformation theorems in quiver representation theory, called diamond principles. All algorithms are implemented in the computational library Gudhi.
Complete list of metadatas

Cited literature [64 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Thursday, March 5, 2015 - 1:38:14 PM
Last modification on : Saturday, January 27, 2018 - 1:31:35 AM
Document(s) archivé(s) le : Saturday, June 6, 2015 - 10:47:01 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01123744, version 1



Clément Maria. Algorithms and data structures in computational topology. Other [cs.OH]. Université Nice Sophia Antipolis, 2014. English. ⟨NNT : 2014NICE4081⟩. ⟨tel-01123744⟩



Record views


Files downloads