The compressed annotation matrix: an efficient data structure for computing persistent cohomology

DOI10.1007/s00453-015-9999-4zbMath1330.68050arXiv1304.6813OpenAlexW2155796097MaRDI QIDQ893322

Jean-Daniel Boissonnat, Clément Maria, Tamal Krishna Dey

Publication date: 19 November 2015

Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6813

zbMATH Keywords

algorithmsimplicial compleximplementationdata structurepersistent cohomologyannotation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Simplicial sets and complexes in algebraic topology (55U10) Other homology theories in algebraic topology (55N35)

Related Items

The Offset Filtration of Convex Objects ⋮ Barcodes of towers and a streaming algorithm for persistent homology ⋮ A heuristic for short homology basis of digital objects ⋮ Homological Shape Analysis Through Discrete Morse Theory ⋮ Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ Persistent homology for low-complexity models ⋮ Discrete Morse theory for computing zigzag persistence ⋮ The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes ⋮ \textsc{Phat} -- persistent homology algorithms toolbox ⋮ Computing persistent homology with various coefficient fields in a single pass ⋮ SimBa

Uses Software

• Gudhi
• PHAT
• Dionysus

Cites Work

• Unnamed Item
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• Persistent cohomology and circular coordinates
• Stability of persistence diagrams
• Computing persistent homology
• Topological persistence and simplification
• An output-sensitive algorithm for persistent homology
• PHAT – Persistent Homology Algorithms Toolbox
• The Gudhi Library: Simplicial Complexes and Persistent Homology
• Annotating Simplices with a Homology Basis and Its Applications
• Dualities in persistent (co)homology
• Clear and Compress: Computing Persistent Homology in Chunks
• Computing Topological Persistence for Simplicial Maps
• Zigzag persistent homology in matrix multiplication time

This page was built for publication: The compressed annotation matrix: an efficient data structure for computing persistent cohomology