Distributed computation of persistent homology

Proceedings of the Workshop on Algorithm Engineering and Experiments

Volumn , Issue , 2014, Pages 31-38

  Bauer, Ulrich ^a   Kerber, Michael ^b   Reininghaus, Jan ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EXPERIMENTS;

ALGORITHMIC DESIGN; DISTRIBUTED COMPUTATIONS; DISTRIBUTED SYSTEMS; PERSISTENT HOMOLOGY; REDUCTION ALGORITHMS; SHARED MEMORY ALGORITHMS; SHARED MEMORY SYSTEM; TOPOLOGICAL FEATURES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84916893505     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973198.4     Document Type: Conference Paper

References (15)

1. U. Bauer, M. Kerber, and J. Reininghaus. Clear and compress: Computing persistent homology in chunks. In Topological Methods in Data Analysis and Visualization III. Springer, 2014. To appear.
2. J.-D. Boissonnat, T. K. Dey, and C. Maria. The compressed annotation matrix: An efficient data structure for computing persistent cohomology. In H. L. Bodlaender and G. F. Italiano, editors, Algorithms - ESA 2013, volume 8125 of Lecture Notes in Computer Science, pages 695-706. Springer Berlin Heidelberg, 2013.
3. F. Chazal, D. C. Steiner, M. Glisse, L. J. Guibas, and S. Y. Oudot. Proximity of persistence modules and their diagrams. In SCG'09: Proceedings of the 25th annual symposium on Computational geometry, pages 237-246. ACM, 2009.
4. C. Chen and M. Kerber. An output-sensitive algorithm for persistent homology. Computational Geometry, 46(4):435-447, 2013.
5. C. Chen and M. Kerber. Persistent homology computation with a twist. In 27th European Workshop on Computational Geometry (EuroCG), pages 197-200, 2011.
6. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete and Computational Geometry, 37(1):103-120, 2007.
7. H. Edelsbrunner and J. Harer. Computational Topology, An Introduction. American Mathematical Society, 2010.
8. H. Edelsbrunner and J. Harer. Persistent homology - a survey. In J. E. Goodman, J. Pach, and R. Pollack, editors, Surveys on Discrete and Computational Geometry: Twenty Years Later, Contemporary Mathematics, pages 257-282. 2008.
9. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete & Computational Geometry, 28(4):511-533, 2002.
10. R. H. Lewis and A. Zomorodian. Multicore homology. Manuscript, 2012.
11. D. Lipsky, P. Skraba, and M. Vejdemo-Johansson. A spectral sequence for parallelized persistence. 2011. arXiv:1112.1245.
12. N. Milosavljević, D. Morozov, and P. Skraba. Zigzag persistent homology in matrix multiplication time. In Proceedings of the twenty-seventh annual symposium on Computational geometry, SoCG'11, pages 216-225. ACM, 2011.
13. D. Morozov. Persistence algorithm takes cubic time in the worst case. In BioGeometry News. Duke Computer Science, Durham, NC, 2005.
14. J. Peacock. Cosmological Physics. Cambridge University Press, 1999.
15. A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete & Computational Geometry, 33(2):249-274, 2005.