PHAT – Persistent Homology Algorithms Toolbox

Journal of Symbolic Computation

Volumn 78, Issue , 2017, Pages 76-90

  Bauer, Ulrich ^a   Kerber, Michael ^b   Reininghaus, Jan ^c   Wagner, Hubert ^d  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c SIEMENS AG   (Germany)

^d INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

Algorithm engineering; Matrix reduction; Persistent homology; Topological data analysis

Indexed keywords

EID: 84962422625     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2016.03.008     Document Type: Article

References (29)

1. Adams, H., Tausz, A., Vejdemo-Johansson, M., javaPlex: a research software package for persistent (co)homology. Hong, H., Yap, C., (eds.) Mathematical Software – ICMS 2014 Lecture Notes in Computer Science, vol. 8592, 2014, Springer, Berlin, Heidelberg, 129–136 http://dx.doi.org/10.1007/978-3-662-44199-2_ 23.
2. Alexandrescu, A., Modern C++ Design: Generic Programming and Design Patterns Applied. 2001, Addison–Wesley.
3. Austern, M.H., Generic Programming and the STL. 1999, Addison–Wesley.
4. Bauer, U., Kerber, M., Reininghaus, J., Clear and compress: computing persistent homology in chunks. Topological Methods in Data Analysis and Visualization III Mathematics and Visualization, 2014, Springer, 103–117 http://dx.doi.org/10.1007/978-3-319-04099-8_7.
5. Bauer, U., Kerber, M., Reininghaus, J., Distributed computation of persistent homology. 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014, 2014, 31–38.
6. Boissonnat, J., Dey, T.K., Maria, C., The compressed annotation matrix: an efficient data structure for computing persistent cohomology. Algorithms – ESA 2013 – 21st Annual European Symposium, Proceedings, Sophia Antipolis, France, September 2–4, 2013, 2013, 695–706.
7. Boissonnat, J., Maria, C., The simplex tree: an efficient data structure for general simplicial complexes. Algorithms – ESA 2012 – 20th Annual European Symposium, Proceedings, Ljubljana, Slovenia, September 10–12, 2012, 2012, 731–742.
8. Chen, C., Kerber, M., Persistent homology computation with a twist. 27th European Workshop on Computational Geometry (EuroCG), 2011, 197–200 URL http://eurocg11.inf.ethz.ch/abstracts/22.pdf.
9. Chen, C., Kerber, M., An output-sensitive algorithm for persistent homology. Comput. Geom. 46:4 (2013), 435–447, 10.1016/j.comgeo.2012.02.010.
10. Cohen-Steiner, D., Edelsbrunner, H., Morozov, D., Vines and vineyards by updating persistence in linear time. Proceedings of the Twenty-second Annual Symposium on Computational Geometry, SCG'06, 2006, ACM, New York, NY, USA, 119–126.
11. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., Introduction to Algorithms. third edition, 2009, The MIT Press.
12. de Silva, V., Morozov, D., Vejdemo-Johansson, M., Dualities in persistent (co)homology. Inverse Probl., 27(12), 2011, 124003+, 10.1088/0266-5611/27/12/124003.
13. Edelsbrunner, H., Harer, J., Persistent homology – a survey. Surveys on Discrete and Computational Geometry: Twenty Years Later Contemporary Mathematics, 2008, 257–282.
14. Edelsbrunner, H., Harer, J., Computational Topology. An Introduction. 2010, American Mathematical Society.
15. Edelsbrunner, H., Letscher, D., Zomorodian, A., Topological persistence and simplification. Discrete Comput. Geom. 28:4 (2002), 511–533, 10.1007/s00454-002-2885-2.
16. Fasy, B.T., Kim, J., Lecci, F., Maria, C., Introduction to the R package TDA. arXiv:1411.1830 [cs.MS], 2015.
17. Forman, R., Morse theory for cell complexes. Adv. Math. 134:1 (1998), 90–145, 10.1006/aima.1997.1650.
18. Günther, D., Reininghaus, J., Hotz, I., Wagner, H., Memory-efficient computation of persistent homology for 3D images using discrete Morse theory. 24th SIBGRAPI Conference on Graphics, Patterns and Images, Sibgrapi 2011, Alagoas, Maceió, Brazil, August 28–31, 2011, 2011, 25–32.
19. Günther, D., Reininghaus, J., Wagner, H., Hotz, I., Efficient computation of 3D Morse–Smale complexes and persistent homology using discrete Morse theory. Vis. Comput. 28:10 (2012), 959–969, 10.1007/s00371-012-0726-8.
20. Kasten, J., Reininghaus, J., Reich, W., Scheuermann, G., Toward the extraction of saddle periodic orbits. Topological Methods in Data Analysis and Visualization III Mathematics and Visualization, 2014, Springer, 55–69 http://dx.doi.org/10.1007/978-3-319-04099-8_4.
21. Lewis, R.H., Zomorodian, A., Multicore homology via Mayer Vietoris. arXiv:1407.2275 [cs.CG], 2014.
22. Lipsky, D., Skraba, P., Vejdemo-Johansson, M., A spectral sequence for parallelized persistence. arXiv:1112.1245 [cs.CG], 2011.
23. Maria, C., Boissonnat, J., Glisse, M., Yvinec, M., The Gudhi library: simplicial complexes and persistent homology. Mathematical Software – ICMS 2014 – 4th International Congress, Proceedings, Seoul, South Korea, August 5–9, 2014, 2014, 167–174.
24. Milosavljevic, N., Morozov, D., Skraba, P., Zigzag persistent homology in matrix multiplication time. Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13–15, 2011, 2011, 216–225.
25. Mischaikow, K., Nanda, V., Morse theory for filtrations and efficient computation of persistent homology. Discrete Comput. Geom. 50:2 (2013), 330–353, 10.1007/s00454-013-9529-6.
26. Morozov, D., Dionysus. URL http://www.mrzv.org/software/dionysus, 2010.
27. Nanda, V., Perseus: the persistent homology software. Accessed 30/01/15. URL http://www.sas.upenn.edu/~vnanda/perseus, 2013.
28. Wagner, H., Dłotko, P., Towards topological analysis of high-dimensional feature spaces. Comput. Vis. Image Underst. 121 (2014), 21–26, 10.1016/j.cviu.2014.01.005.
29. Zomorodian, A., Carlsson, G.E., Computing persistent homology. Discrete Comput. Geom. 33:2 (2005), 249–274, 10.1007/s00454-004-1146-y.