Parallel Computation of Piecewise Linear Morse-Smale Segmentations - Institut des sciences du calcul et des données Access content directly
Journal Articles IEEE Transactions on Visualization and Computer Graphics Year : 2023

Parallel Computation of Piecewise Linear Morse-Smale Segmentations

Abstract

This paper presents a well-scaling parallel algorithm for the computation of Morse-Smale (MS) segmentations, including the region separators and region boundaries. The segmentation of the domain into ascending and descending manifolds, solely defined on the vertices, improves the computational time using path compression and fully segments the border region. Region boundaries and region separators are generated using a multi-label marching tetrahedra algorithm. This enables a fast and simple solution to find optimal parameter settings in preliminary exploration steps by generating an MS complex preview. It also poses a rapid option to generate a fast visual representation of the region geometries for immediate utilization. Two experiments demonstrate the performance of our approach with speedups of over an order of magnitude in comparison to two publicly available implementations. The example section shows the similarity to the MS complex, the useability of the approach, and the benefits of this method with respect to the presented datasets. We provide our implementation with the paper.
Fichier principal
Vignette du fichier
2303.15491.pdf (12.64 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04055672 , version 1 (03-04-2023)

Identifiers

Cite

Robin G. C. Maack, Jonas Lukasczyk, Julien Tierny, Hans Hagen, Ross Maciejewski, et al.. Parallel Computation of Piecewise Linear Morse-Smale Segmentations. IEEE Transactions on Visualization and Computer Graphics, In press, pp.1-14. ⟨10.1109/TVCG.2023.3261981⟩. ⟨hal-04055672⟩
9 View
18 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More