Strong Collapse for Persistence - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Strong Collapse for Persistence

Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 830857
Siddharth Pritam
  • Function : Author
  • PersonId : 1036951
Divyansh Pareek
  • Function : Author
  • PersonId : 1036952


We introduce a fast and memory ecient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by J. Barmak and E. Miniam [1], and to compute the PH of an induced sequence of reduced simplicial complexes that has the same PH as the initial one. Our approach has several salient features that distinguishes it from previous work. It is not limited to filtrations (i.e. sequences of nested simplicial subcomplexes) but works for other types of sequences like towers and zigzags. To strong collapse a simplicial complex, we only need to store the maximal simplices of the complex, not the full set of all its simplices, which saves a lot of space and time. Moreover, the complexes in the sequence can be strong collapsed independently and in parallel. As a result and as demonstrated by numerous experiments on publicly available data sets, our approach is extremely fast and memory ecient in practice. 1998 ACM Subject Classification Dummy classification-please refer to about/class/ccs98-html
Fichier principal
Vignette du fichier
ESA_2018_Track_B_paper_21.pdf (877.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01886165 , version 1 (02-10-2018)



Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek. Strong Collapse for Persistence. ESA 2018 - 26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. pp.67:1--67:13, ⟨10.4230/LIPIcs⟩. ⟨hal-01886165⟩
159 View
168 Download



Gmail Facebook X LinkedIn More