Computing and visualizing time-varying merge trees for high-dimensional data
- Univ. of Leipzig (Germany)
- Univ. of Kaiserslautern (Germany)
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
We introduce a new method that identifies and tracks features in arbitrary dimensions using the merge tree -- a structure for identifying topological features based on thresholding in scalar fields. This method analyzes the evolution of features of the function by tracking changes in the merge tree and relates features by matching subtrees between consecutive time steps. Using the time-varying merge tree, we present a structural visualization of the changing function that illustrates both features and their temporal evolution. We demonstrate the utility of our approach by applying it to temporal cluster analysis of high-dimensional point clouds.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 1393102
- Resource Relation:
- Related Information: Book Title: Mathematics and Visualization
- Country of Publication:
- United States
- Language:
- English
Similar Records
Interactive Exploration and Analysis of Large-Scale Simulations Using Topology-Based Data Segmentation
Computing a Stable Distance on Merge Trees
A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm
Journal Article
·
Fri Dec 17 00:00:00 EST 2010
· IEEE Transactions on Visualization and Computer Graphics
·
OSTI ID:1393102
+3 more
Computing a Stable Distance on Merge Trees
Journal Article
·
Wed Oct 05 00:00:00 EDT 2022
· IEEE Transactions on Visualization and Computer Graphics
·
OSTI ID:1393102
A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm
Technical Report
·
Fri Apr 29 00:00:00 EDT 2022
·
OSTI ID:1393102