Notes on the Simplification of the Morse-Smale Complex

The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.

[1]  Thomas Lewiner,et al.  Optimal discrete Morse functions for 2-manifolds , 2003, Comput. Geom..

[2]  Bernd Hamann,et al.  Topology-Controlled Volume Rendering , 2006, IEEE Transactions on Visualization and Computer Graphics.

[3]  Ingrid Hotz,et al.  Noname manuscript No. (will be inserted by the editor) Efficient Computation of 3D Morse-Smale Complexes and Persistent Homology using Discrete Morse Theory , 2022 .

[4]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[5]  S. Smale On Gradient Dynamical Systems , 1961 .

[6]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Herbert Edelsbrunner,et al.  Hierarchical morse complexes for piecewise linear 2-manifolds , 2001, SCG '01.

[8]  M. Morse The Calculus of Variations in the Large , 1934 .

[9]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[10]  Henry King,et al.  Generating Discrete Morse Functions from Point Data , 2005, Exp. Math..

[11]  Bernd Hamann,et al.  Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions , 2007, IEEE Transactions on Visualization and Computer Graphics.

[12]  Peter John Wood,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images , 2022 .

[13]  Bernd Hamann,et al.  Practical Considerations in Morse-Smale Complex Computation , 2011, Topological Methods in Data Analysis and Visualization.

[14]  Ulrich Bauer,et al.  Persistence in discrete Morse theory , 2011 .

[15]  Marc E. Pfetsch,et al.  Computing Optimal Morse Matchings , 2006, SIAM J. Discret. Math..

[16]  A. Gyulassy Combinatorial construction of morse-smale complexes for data analysis and visualization , 2008 .

[17]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[18]  Vijay Natarajan,et al.  Parallel Computation of 3D Morse‐Smale Complexes , 2012, Comput. Graph. Forum.

[19]  Tamal K. Dey,et al.  Persistent Heat Signature for Pose‐oblivious Matching of Incomplete Models , 2010, Comput. Graph. Forum.

[20]  Jan Reininghaus Computational discrete Morse theory , 2012 .

[21]  David Günther Topological analysis of discrete scalar data , 2012 .

[22]  R. Forman A USER'S GUIDE TO DISCRETE MORSE THEORY , 2002 .

[23]  Hans-Peter Seidel,et al.  On the Applicability of Topological Methods for Complex Flow Data , 2007, Topology-based Methods in Visualization.