Gudhi

The Gudhi Library: Simplicial Complexes and Persistent Homology. We present the main algorithmic and design choices that have been made to implement the construction and manipulation of simplicial complexes and the computation of persistent homology in the Gudhi library. The Gudhi library (Geometric Understanding in Higher Dimensions) is a generic C++ library for computational topology. Its goal is to provide robust, efficient, flexible and easy to use implementations of state-of-the-art algorithms and data structures for computational topology. An application of interest for computational topology is topological data analysis, where one is interested in learning topological invariants of a shape, sampled by a point cloud. A popular approach is to construct, at different scales, an approximation of the shape using simplicial complexes built on top of the points, and then compute the persistent homology of these complexes. The simplicial complex and persistent homology packages in Gudhi provide all software components for this approach. Specifically, simplicial complexes are implemented with a simplex tree data structure. The simplex tree is an efficient and flexible data structure for representing general (filtered) simplicial complexes. The persistent homology of a filtered simplicial complex is computed by mean of the persistent cohomology algorithm, implemented with a compressed annotation matrix. Persistent cohomology is the dual of persistent homology, and provides the same topological invariant represented by a persistence diagram. The persistent homology package provides as well the implementation of the multi-field persistence framework, i.e. the computation of persistence with various field coefficients in a single pass. We present the different components of the software, their interaction and the user interface. We justify the algorithmic and design decisions made in Gudhi, and provide detailed benchmarks of the code. Joint work with Jean-Daniel Boissonnat, Marc Glisse and Mariette Yvinec.


References in zbMATH (referenced in 14 articles , 1 standard article )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Dey, Tamal K.; Shi, Dayu; Wang, Yusu: SimBa: an efficient tool for approximating Rips-filtration persistence via Simplicial Batch collapse (2019)
  2. Kerber, Michael; Schreiber, Hannah: Barcodes of towers and a streaming algorithm for persistent homology (2019)
  3. Mémoli, Facundo; Singhal, Kritika: A primer on persistent homology of finite metric spaces (2019)
  4. Salnikov, Vsevolod; Cassese, Daniele; Lambiotte, Renaud: Simplicial complexes and complex systems (2019)
  5. Alan Hylton, Gregory Henselman-Petrusek, Janche Sang, Robert Short: Tuning the Performance of a Computational Persistent Homology Package (2018) arXiv
  6. Franek, Peter; Krčál, Marek; Wagner, Hubert: Solving equations and optimization problems with uncertainty (2018)
  7. Bauer, Ulrich; Kerber, Michael; Reininghaus, Jan; Wagner, Hubert: \textscPhat-- persistent homology algorithms toolbox (2017)
  8. Bubenik, Peter; Dłotko, Paweł: A persistence landscapes toolbox for topological statistics (2017)
  9. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  10. Boissonnat, Jean-Daniel; Dey, Tamal K.; Maria, Clément: The compressed annotation matrix: an efficient data structure for computing persistent cohomology (2015)
  11. Boissonnat, Jean-Daniel; Karthik, C. S.; Tavenas, Sébastien: Building efficient and compact data structures for simplicial complexes (2015)
  12. Boissonnat, Jean-Daniel; Maria, Clément: Computing persistent homology with various coefficient fields in a single pass (2014)
  13. Brittany Terese Fasy, Jisu Kim, Fabrizio Lecci, Clement Maria: Introduction to the R package TDA (2014) arXiv
  14. Maria, Clément; Boissonnat, Jean-Daniel; Glisse, Marc; Yvinec, Mariette: The Gudhi library: simplicial complexes and persistent homology (2014)