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,...
Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 13(2007), 6 vom: 01. Nov., Seite 1440-7 |
---|---|
1. Verfasser: | |
Weitere Verfasser: | , , |
Format: | Aufsatz |
Sprache: | English |
Veröffentlicht: |
2007
|
Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics |
Schlagworte: | Journal Article |
Zusammenfassung: | 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 |
---|---|
Beschreibung: | Date Completed 14.12.2007 Date Revised 30.10.2007 published: Print Citation Status PubMed-not-MEDLINE |
ISSN: | 1941-0506 |