Task-based Augmented Reeb Graphs with Dynamic ST-Trees

Abstract : This paper presents, to the best of our knowledge, the first parallel algorithm for the computation of the augmented Reeb graph of piecewise linear scalar data. Such augmented Reeb graphs have a wide range of applications , including contour seeding and feature based segmentation. Our approach targets shared-memory multi-core workstations. For this, it completely revisits the optimal, but sequential, Reeb graph algorithm, which is capable of handing data in arbitrary dimension and with optimal time complexity. We take advantage of Fibonacci heaps to exploit the ST-Tree data structure through independent local propagations, while maintaining the optimal, linearithmic time complexity of the sequential reference algorithm. These independent propagations can be expressed using OpenMP tasks, hence benefiting in parallel from the dynamic load balancing of the task runtime while enabling us to increase the parallelism degree thanks to a dual sweep. We present performance results on triangulated surfaces and tetrahedral meshes. We provide comparisons to related work and show that our new algorithm results in superior time performance in practice, both in sequential and in parallel. An open-source C++ implementation is provided for reproducibility.
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02159825
Contributor : Julien Tierny <>
Submitted on : Wednesday, June 19, 2019 - 9:21:41 AM
Last modification on : Thursday, October 3, 2019 - 12:06:02 PM

File

gueunet_egpgv19 (2).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02159825, version 1

Citation

Charles Gueunet, Pierre Fortin, Julien Jomier, Julien Tierny. Task-based Augmented Reeb Graphs with Dynamic ST-Trees. Eurographics Symposium on Parallel Graphics and Visualization, Jun 2019, Porto, Portugal. ⟨hal-02159825⟩

Share

Metrics

Record views

35

Files downloads

41