skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Computing a Stable Distance on Merge Trees

Journal Article · · IEEE Transactions on Visualization and Computer Graphics

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. As a result, we demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.

Research Organization:
Univ. of Arizona, Tucson, AZ (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
SC0019039
OSTI ID:
1998147
Journal Information:
IEEE Transactions on Visualization and Computer Graphics, Vol. 29, Issue 1; ISSN 1077-2626
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

References (31)

Symmetry in Scalar Field Topology journal December 2011
The Tree-to-Tree Correction Problem journal July 1979
Robust on-line computation of Reeb graphs: simplicity and speed journal July 2007
Visualization of High-Dimensional Point Clouds Using Their Density Distribution's Topology journal November 2011
Comparative Analysis of Merge Trees Using Local Tree Edit Distance journal February 2023
Global Feature Tracking and Similarity Estimation in Time‐Dependent Scalar Fields journal June 2017
Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data: Extended Branch Decomposition Graphs journal June 2014
Stability of persistence diagrams conference January 2005
Extending Persistence Using Poincaré and Lefschetz Duality journal April 2008
Categorified Reeb Graphs journal April 2016
Reeb graphs of curves are stable under function perturbations journal May 2012
The Edit Distance for Reeb Graphs of Surfaces journal January 2016
Visualizing Nuclear Scission through a Multifield Extension of Topological Analysis journal December 2012
Morse-smale complexes for piecewise linear 3-manifolds conference January 2003
Topological Persistence and Simplification journal November 2002
Understanding the Structure of the Turbulent Mixing Layer in Hydrodynamic Instabilities journal September 2006
Measuring Distance between Reeb Graphs conference June 2014
Topology matching for fully automatic similarity estimation of 3D shapes
  • Hilaga, Masaki; Shinagawa, Yoshihisa; Kohmura, Taku
  • Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01 https://doi.org/10.1145/383259.383282
conference January 2001
Interactive Exploration and Analysis of Large-Scale Simulations Using Topology-Based Data Segmentation journal September 2011
Computing the Gromov-Hausdorff Distance for Metric Trees journal June 2018
Computing contour trees in all dimensions journal February 2003
Comparing stars: on approximating graph edit distance journal August 2009
Characterizing Molecular Interactions in Chemical Systems journal December 2014
Groups of polynomial growth and expanding maps journal December 1981
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality journal November 2008
Exploring the evolution of pressure-perturbations to understand atmospheric phenomena conference April 2017
Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees journal November 2009
Generic objective vortices for flow visualization journal July 2017
A Survey of Topology-based Methods in Visualization journal June 2016
Topologically Clean Distance Fields journal November 2007
Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization journal June 2021