Optimization and Augmentation for Data Parallel Contour Trees

Hamish Carr, Oliver Rübel, Gunther Weber, James Ahrens

External link (DOI)
View presentation:2021-10-28T14:00:00ZGMT-0600Change your timezone on the schedule page
2021-10-28T14:00:00Z
Exemplar figure, described by caption below
Parallel acceleration of contour tree augmentation uses a hyperstructure such as this one computed for a small part of the landscape around Vancouver.
Fast forward

Direct link to video on YouTube: https://youtu.be/DXUTqnzLESE

Keywords

Computational Topology, Contour Tree, Parallel Algorithms

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.