Contour Forests: Fast Multi-threaded Augmented Contour Trees

Abstract : This paper presents a new algorithm for the fast, shared memory multi-threaded computation of contour trees on tetrahedral meshes. In contrast to previous multi-threaded algorithms, our technique computes the augmented contour tree. Such an augmentation is required to enable the full extent of contour tree based applications, including for instance data segmentation. Our approach relies on a range-driven domain partitioning. We show how to exploit such a partitioning to rapidly compute contour forests. We also show how such forests can be efficiently turned into the output contour tree. We report performance numbers that compare our approach to a reference sequential implementation for the computation of augmented contour trees. These experiments demonstrate the run-time efficiency of our approach. We demonstrate the utility of our approach with several data segmentation tasks. We also provide a lightweight VTK-based C++ implementation of our approach for reproduction purposes.
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01355328
Contributor : Julien Tierny <>
Submitted on : Tuesday, August 23, 2016 - 9:37:04 AM
Last modification on : Thursday, March 21, 2019 - 2:46:14 PM
Long-term archiving on : Thursday, November 24, 2016 - 12:27:19 PM

Identifiers

  • HAL Id : hal-01355328, version 1

Citation

Charles Gueunet, Pierre Fortin, Julien Jomier, Julien Tierny. Contour Forests: Fast Multi-threaded Augmented Contour Trees. IEEE Symposium on Large Data Analysis and Visualization, Oct 2016, Baltimore, United States. ⟨hal-01355328⟩

Share

Metrics

Record views

433

Files downloads

390