Optimization and Augmentation for Data Parallel Contour Trees.
IEEE Trans Vis Comput Graph
; 28(10): 3471-3485, 2022 10.
Article
en En
| MEDLINE
| ID: mdl-33684039
ABSTRACT
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.
Texto completo:
1
Colección:
01-internacional
Base de datos:
MEDLINE
Asunto principal:
Gráficos por Computador
Idioma:
En
Revista:
IEEE Trans Vis Comput Graph
Asunto de la revista:
INFORMATICA MEDICA
Año:
2022
Tipo del documento:
Article