Efficient computation of 3D Morse-Smale complexes and persistent homology using discrete Morse theory

Visual Computer

Volumn 28, Issue 10, 2012, Pages 959-969

  Günther, David ^a   Reininghaus, Jan ^b   Wagner, Hubert ^c   Hotz, Ingrid ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Discrete Morse theory; Large data; Morse Smale complex; Persistent homology

Indexed keywords

COMMODITY HARDWARE; DISCRETE MORSE THEORY; EFFICIENT COMPUTATION; GRAY-SCALE IMAGES; INPUT DATAS; LARGE DATA; MEMORY CONSUMPTION; MORSE-SMALE COMPLEX; PARALLEL COMPUTATION; PERSISTENT HOMOLOGY; PRACTICAL RUNNING TIME; RUNNING TIME; TOPOLOGICAL COMPLEXITY;

ALGORITHMS; INPUT OUTPUT PROGRAMS; THREE DIMENSIONAL COMPUTER GRAPHICS; TOPOLOGY;

COMPUTATIONAL EFFICIENCY;

EID: 84869036006     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-012-0726-8     Document Type: Conference Paper

References (27)

1. The Institute of Computer Graphics and Algorithms. http://www. cg.tuwien.ac.at/research/vis/datasets/
2. Volvis: Voxel Data Repository (2010). http://www.volvis.org/
3. Bauer, U., Lange, C., Wardetzky, M.: Optimal topological simplification of discrete functions on surfaces. Discrete & Computational Geometry 47(2), 1-31
4. Bendich, P., Edelsbrunner, H., Kerber, M.: Computing robustness and persistence for images. Proc. -IEEE Conf. Inf. Vis. 16, 1251-1260 (2010)
5. Chari, M.K.: On discrete Morse functions and combinatorial decompositions. Discrete Math. 217(1-3), 101-113 (2000)
6. Chen, C., Kerber, M.: An output-sensitive algorithm for persistent homology. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG '11), pp. 207-216. ACM, New York (2011)
7. Chen, C., Kerber, M.: Persistent homology computation with a twist. In: 27th European Workshop on Comp. Geometry (EuroCG 2011) (2011)
8. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37, 103-120 (2007)
9. Edelsbrunner, H., Harer, J.: Computational Topology. An Introduction. American Mathematical Society (2010)
10. Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511-533 (2002) (Pubitemid 36161396)
11. Forman, R.: Morse theory for cell complexes. Adv. Math. 134, 90-145 (1998) (Pubitemid 128347573)
12. Forman, R.: A user's guide to discrete Morse theory. In: Seminaire Lotharingien de Combinatoire, vol. B48c, pp. 1-35 (2002)
13. Günther, D., Reininghaus, J., Prohaska, S., Weinkauf, T., Hege, H.C.: Efficient computation of a hierarchy of discrete 3d gradient vector fields. In: Peikert, R., Hauser, H., Carr, H., Fuchs, R. (eds.) Topological Methods in Data Analysis and Visualization. II. Mathematics and Visualization (TopoInVis 2011), Zürich, Switzerland, April 4-6, pp. 15-30. Springer, Berlin (2012)
14. Günther, D., Reininghaus, J., Wagner, H., Hotz, I.: Memory efficient computation of persistent homology for 3D image data using discrete Morse theory. In: Lewiner, T., Torres, R. (eds.) Proceedings of Conference on Graphics, Patterns and Images (SIBGRAPI), Maceió, Los Alamitos, vol. 24, pp. 25-32. IEEE Press, New York (2011)
15. Gyulassy, A., Bremer, P.T., Hamann, B., Pascucci, V.: A practical approach to Morse-Smale complex computation: scalability and generality. IEEE Trans. Vis. Comput. Graph. 14, 1619-1626 (2008)
16. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
17. Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational Homology. Applied Math. Sciences, vol. 157. Springer, Berlin (2004)
18. Lewiner, T.: Geometric discrete Morse complexes. Ph.D. thesis, Dept. Of Mathematics, PUC-Rio (2005)
19. Lewiner, T., Lopes, H., Tavares, G.: Optimal discrete Morse functions for 2-manifolds. Comput. Geom. 26(3), 221-233 (2003)
20. Milnor, J.: Topology from the Differentiable Viewpoint. University of Virginia Press, Charlottesville (1965)
21. Milosavljevi'c, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG '11), pp. 216-225. ACM, New York (2011)
22. Morozov, D.: Persistence algorithm takes cubic time in the worst case. In: BioGeometry News. Duke Computer Science, Durhmam (2005)
23. Mrozek, M., Wanner, T.: Coreduction homology algorithm for inclusions and persistent homology. Comput.Math. Appl. 60, 2812-2833 (2010)
24. Reininghaus, J., Günther, D., Hotz, I., Prohaska, S., Hege, H.C., TADD: A computational framework for data analysis using discrete Morse theory. In: Mathematical Software (ICMS 2010), pp. 198-208. Springer, Berlin (2010)
25. Robins, V., Wood, P., Sheppard, A.: Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1646-1658 (2011)
26. Röttger, S.: http://www9.informatik.uni-erlangen.de/External/vollib/
27. Wagner, H., Chen, C., Vucini, E.: Efficient computation of persistent homology for cubical data. In: Peikert, R., Hauser, H., Carr, H., Fuchs, R. (eds.) Topological Methods in Data Analysis and Visualization. II. Mathematics and Visualization (TopoInVis 2011), Zürich, Switzerland, April 4-6, pp. 91-108. Springer, Berlin (2012)