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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8125 LNCS, Issue , 2013, Pages 695-706

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

^a INRIA   (France)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

ALGORITHMS; DATA STRUCTURES;

TOPOLOGY;

EID: 84884335320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40450-4_59     Document Type: Conference Paper

References (14)

1. Bauer, U., Kerber, M., Reininghaus, J.: Clear and compress: Computing persistent homology in chunks. arXiv/1303.0477 (2013)
2. Boissonnat, J.-D., Maria, C.: The simplex tree: An efficient data structure for general simplicial complexes. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 731-742. Springer, Heidelberg (2012)
3. Busaryev, O., Cabello, S., Chen, C., Dey, T.K., Wang, Y.: Annotating simplices with a homology basis and its applications. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 189-200. Springer, Heidelberg (2012)
4. Chen, C., Kerber, M.: Persistent homology computation with a twist. In: Proceedings 27th European Workshop on Computational Geometry (2011)
5. Chen, C., Kerber, M.: An output-sensitive algorithm for persistent homology. Comput. Geom. 46(4), 435-447 (2013)
6. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete & Computational Geometry 37(1), 103-120 (2007)
7. de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Dualities in persistent (co)homology. Inverse Problems 27, 124003 (2011)
8. de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Persistent cohomology and circular coordinates. Discrete Comput. Geom. 45, 737-759 (2011)
9. Dey, T.K., Fan, F., Wang, Y.: Computing topological persistence for simplicial maps. CoRR, abs/1208.5018 (2012)
10. Edelsbrunner, H., Harer, J.: Computational Topology - an Introduction. American Mathematical Society (2010)
11. Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511-533 (2002)
12. Milosavljevic, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Symposium on Comp. Geom. (2011)
13. Morozov, D.: Persistence algorithm takes cubic time in worst case. In: BioGeometry News, Dept. Comput. Sci., Duke Univ. (2005)
14. Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete & Computational Geometry 33(2), 249-274 (2005)