Efficient computation of Morse-Smale complexes for three-dimensional scalar functions.
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.
Gyulassy
Attila
A
Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis, USA. aggyulassy@ucdavis.edu
Natarajan
Vijay
V
Pascucci
Valerio
V
Hamann
Bernd
B