An efficient representation for filtrations of simplicial complexes

DOI10.1137/1.9781611974782.179MaRDI QIDQ4575929zbMATH OpenOpenAlexFDO

Authors Jean-Daniel Boissonnat, C. S. Karthik

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.179

Mathematics Subject Classification ID

General topology of complexes (57Q05) Data structures (68P05)

Recommendations

• An efficient representation for filtrations of simplicial complexes
• Efficient data structure for representing and simplifying simplicial complexes in high dimensions
• Building efficient and compact data structures for simplicial complexes

Cited in

(6)

• Improved approximate Rips filtrations with shifted integer lattices and cubical complexes
• An efficient representation for filtrations of simplicial complexes
• Strong Collapse for Persistence
• Computing persistent homology of flag complexes via strong collapses
• Efficient data structure for representing and simplifying simplicial complexes in high dimensions
• Strong collapse and persistent homology

This page was built for publication: An efficient representation for filtrations of simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575929)