The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology

Algorithmica

Volumn 73, Issue 3, 2015, Pages 607-619

  Boissonnat, Jean Daniel ^a   Dey, Tamal K ^b   Maria, Clément ^a  

^a INRIA   (France)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Algorithm; Annotation; Data structure; Implementation; Persistent cohomology; Simplicial complex

Indexed keywords

ALGORITHMS; DATA STRUCTURES; TOPOLOGY;

ANNOTATION; COHOMOLOGY; EFFICIENT DATA STRUCTURES; IMPLEMENTATION; MATRIX OPERATIONS; PERSISTENT HOMOLOGY; SIMPLICIAL COMPLEX; TIME AND SPACE COMPLEXITY;

MATRIX ALGEBRA;

EID: 84945459116     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-015-9999-4     Document Type: Article

References (19)

1. Bauer, U., Kerber, M., Reininghaus, J.: PHAT. https://code.google.com/p/phat/ (2013)
2. Bauer, U., Kerber, M., Reininghaus, J.: Clear and compress: computing persistent homology in chunks. In: Topological Methods in Data Analysis and Visualization III, pp. 103–117 (2014)
3. Bauer, U., Kerber, M., Reininghaus, J., Wagner, H.: PHAT—persistent homology algorithms toolbox. In: Mathematical Software—ICMS 2014—4th International Congress, Seoul, South Korea, August 5–9, 2014. Proceedings, pp. 137–143 (2014)
4. Boissonnat, J.-D., Maria, C.: The simplex tree: an efficient data structure for general simplicial complexes. Algorithmica 70(3), 406–427 (2014)
5. Busaryev, O., Cabello, S., Chen, C., Dey, T.K., Wang, Y.: Annotating simplices with a homology basis and its applications. In: SWAT, pp. 189–200 (2012)
6. Chen, C., Kerber, M.: Persistent homology computation with a twist. In: Proceedings 27th European Workshop on Computational Geometry (2011)
7. Chen, C., Kerber, M.: An output-sensitive algorithm for persistent homology. Comput. Geom. 46(4), 435–447 (2013)
8. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103–120 (2007)
9. de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Dualities in persistent (co)homology. CoRR arXiv:1107.5665 (2011)
10. de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Persistent cohomology and circular coordinates. Discrete Comput. Geom. 45(4), 737–759 (2011)
11. Dey, T.K., Fan, F., Wang, Y.: Computing topological persistence for simplicial maps. In: Symposium on Computational Geometry, p. 345 (2014)
12. Edelsbrunner, H., Harer, J.: Computational Topology—An Introduction. American Mathematical Society, Providence, RI (2010)
13. Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511–533 (2002)
14. Maria, C.: Gudhi, Simplicial Complexes and Persistent Homology Packages. https://project.inria.fr/gudhi/software/
15. Maria, C., Boissonnat, J.-D., Glisse, M., Yvinec, M.: The Gudhi library: Simplicial complexes and persistent homology. In: International Congress on Mathematical Software, pp. 167–174 (2014)
16. Milosavljevic, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Symposium on Computational Geometry (2011)
17. Morozov, D.: Dionysus. http://www.mrzv.org/software/dionysus/
18. Morozov, D.: Persistence algorithm takes cubic time in worst case. In: BioGeometry News, Department of Computer Science, Duke University (2005)
19. Zomorodian, A., Carlsson, G.E.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249–274 (2005)