Distributed Hierarchical Contour Trees
Contour trees are a significant tool for data analysis as they capture both local and global variation. However, their utility has been limited by scalability, in particular for distributed computation and storage. We report a distributed data structure for storing the contour tree of a data set distributed on a cluster, based on a fan-in hierarchy, and an algorithm for computing it based on the boundary tree that represents only the superarcs of a contour tree that involve contours that cross boundaries between blocks. This allows us to limit the communication cost for contour tree computation to the complexity of the block boundaries rather than of the entire data set.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 2371511
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distributed Contour Trees
Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
Scalable Contour Tree Computation by Data Parallel Peak Pruning
Conference
·
2014
·
OSTI ID:1134246
Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
Conference
·
2025
·
OSTI ID:3029185
Scalable Contour Tree Computation by Data Parallel Peak Pruning
Journal Article
·
2019
· IEEE Transactions on Visualization and Computer Graphics
·
OSTI ID:1797740