Optimization and Augmentation for Data Parallel Contour Trees
Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. However, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical...
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1996. - 28(2022), 10 vom: 08. Okt., Seite 3471-3485 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2022
|
| Accès à la collection: | IEEE transactions on visualization and computer graphics |
| Sujets: | Journal Article Research Support, U.S. Gov't, Non-P.H.S. Research Support, Non-U.S. Gov't |
| Résumé: | Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. However, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit |
|---|---|
| Description: | Date Completed 08.09.2022 Date Revised 10.09.2022 published: Print-Electronic Citation Status MEDLINE |
| ISSN: | 1941-0506 |
| DOI: | 10.1109/TVCG.2021.3064385 |