DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Journal Article · · IEEE Transactions on Visualization and Computer Graphics
 [1];  [1];  [1];  [2];  [1]
  1. Univ. Kaiserslautern-Landau (RPTU) (Germany)
  2. Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)

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.

Research Organization:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE National Nuclear Security Administration (NNSA); USDOE Exascale Computing Project
Grant/Contract Number:
AC02-05CH11231
OSTI ID:
2370363
Journal Information:
IEEE Transactions on Visualization and Computer Graphics, Journal Name: IEEE Transactions on Visualization and Computer Graphics Journal Issue: 1 Vol. 30; ISSN 1077-2626
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

References (31)

An Overview of the Topology ToolKit book January 2021
Dual Complexes of Cubical Subdivisions of ℝ n journal November 2011
ParaView: An End-User Tool for Large-Data Visualization book January 2005
Computing contour trees in all dimensions journal February 2003
Simple and optimal output-sensitive construction of contour trees using monotone paths journal February 2005
A direct numerical simulation study of turbulence and flame structure in transverse jets analysed in jet-trajectory based coordinates journal July 2012
The mixing transition in RayleighTaylor instability journal January 1999
Three-dimensional simulation of a Richtmyer–Meshkov instability with a two-scale initial perturbation journal October 2002
Critical Points and Curvature for Embedded Polyhedral Surfaces journal May 1970
On the shortest spanning subtree of a graph and the traveling salesman problem journal January 1956
Computational Topology book January 2009
Formation of Hard Power Laws in the Energetic Particle Spectra Resulting from Relativistic Magnetic Reconnection journal October 2014
OpenMP: an industry standard API for shared-memory programming journal January 1998
A hybrid parallel algorithm for computing and tracking level set topology conference December 2012
Parallel peak pruning for scalable SMP contour tree computation conference October 2016
Task-based augmented merge trees with Fibonacci heaps conference October 2017
VTK-m: Accelerating the Visualization Toolkit for Massively Threaded Architectures journal May 2016
Scalable Contour Tree Computation by Data Parallel Peak Pruning journal January 2019
Optimization and Augmentation for Data Parallel Contour Trees journal October 2022
Parallel Computation of Piecewise Linear Morse-Smale Segmentations journal April 2024
Fast Merge Tree Computation via SYCL conference October 2022
The Topology ToolKit journal January 2018
Toward Localized Topological Data Structures: Querying the Forest for the Tree journal January 2020
A Survey of Topology-based Methods in Visualization journal June 2016
tachyon: Efficient Shared Memory Parallel Computation of Extremum Graphs journal March 2023
Distributed merge trees conference January 2013
Construction of contour trees in 3D in O(n log n) steps conference January 1998
An image synthesizer journal July 1985
Local-global merge tree computation with local exchanges conference November 2019
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms journal January 1990
Simplizialzerlegungen von Beschrankter Flachheit journal July 1942

Similar Records

Optimization and Augmentation for Data Parallel Contour Trees
Journal Article · 2021 · IEEE Transactions on Visualization and Computer Graphics · OSTI ID:1797730

The Local Limit of the Uniform Spanning Tree on Dense Graphs
Journal Article · 2018 · Journal of Statistical Physics · OSTI ID:22787916

Distributed Merge Trees
Conference · 2013 · OSTI ID:1171757