Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse




Conference Paper

Notes on the Simplification of the Morse-Smale Complex


Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Weinkauf,  Tino
Computer Graphics, MPI for Informatics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Guenther, D., Reininghaus, J., Seidel, H.-P., & Weinkauf, T. (2014). Notes on the Simplification of the Morse-Smale Complex. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (pp. 135-150). Cham: Springer. doi:10.1007/978-3-319-04099-8_9.

Cite as:
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 paper, we emphasize the differences between these two representations, and provide a high-level discussion about their advantages and limitations.