Parallel computation of 2D Morse-Smale complexes
The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large 2D datasets at interactive speeds. We employ a re...
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1996. - 18(2012), 10 vom: 13. Okt., Seite 1757-70 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2012
|
| Accès à la collection: | IEEE transactions on visualization and computer graphics |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S. |
| Résumé: | The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large 2D datasets at interactive speeds. We employ a reformulation of the Morse-Smale complex using Forman’s Discrete Morse Theory and achieve scalability by computing the discrete gradient using local accesses only. We also introduce a novel approach to merge gradient paths that ensures accurate geometry of the computed complex. We demonstrate that our algorithm performs well on both multicore environments and on massively parallel architectures such as the GPU |
|---|---|
| Description: | Date Completed 27.02.2013 Date Revised 03.12.2012 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1941-0506 |