Task-based Augmented Merge Trees with Fibonacci Heaps - Archive ouverte HAL Access content directly
Conference Papers Year :

Task-based Augmented Merge Trees with Fibonacci Heaps

Julien Jomier
  • Function : Author
  • PersonId : 972059


This paper presents a new algorithm for the fast, shared memory multi-core computation of augmented merge trees on triangulations. In contrast to most existing parallel algorithms, our technique computes augmented trees. This augmentation is required to enable the full extent of merge tree based applications, including data segmentation. Our approach completely revisits the traditional, sequential merge tree algorithm to re-formulate the computation as a set of independent local tasks based on Fibonacci heaps. This results in superior time performance in practice, in sequential as well as in parallel thanks to the OpenMP task runtime. In the context of augmented contour tree computation, we show that a direct usage of our merge tree procedure also results in superior time performance overall, both in sequential and parallel. We report performance numbers that compare our approach to reference sequential and multi-threaded implementations for the computation of augmented merge and contour trees. These experiments demonstrate the run-time efficiency of our approach as well as its scalability on common workstations. We demonstrate the utility of our approach in data segmentation applications. We also provide a lightweight VTK-based C++ implementation of our approach for reproduction purposes.
Fichier principal
Vignette du fichier
gueunet_ldav17.pdf (5.17 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01575019 , version 1 (05-09-2017)



Charles Gueunet, Pierre Fortin, Julien Jomier, Julien Tierny. Task-based Augmented Merge Trees with Fibonacci Heaps. IEEE Symposium on Large Data Analysis and Visualization 2017, Oct 2017, Phoenix, United States. ⟨10.1109/LDAV.2017.8231846⟩. ⟨hal-01575019⟩
403 View
235 Download



Gmail Facebook Twitter LinkedIn More