Preface IEEE LDAV 2023
Join us for the 13th IEEE Symposium on Large Data Analysis and Visualization (IEEE LDAV) on Monday, October 23rd 2023 collocated with IEEE VIS 2023 in Melbourne, Victoria, Australia.
Bremer, Peer-Timo↗
Engineering topics
Lukasczyk, Jonas
Publications and source records attributed to Lukasczyk, Jonas.
ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs
Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.
97 MATHEMATICS AND COMPUTING↗