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

DOI10.1007/S00453-015-9999-4MaRDI QIDQ6827199zbMATH OpenFDO

Authors Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria

Publication date 19 November 2015

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

algorithmdata structuresimplicial compleximplementationpersistent cohomologyannotation

Mathematics Subject Classification ID

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

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

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