Distributed Hierarchical Contour Trees

Hamish Carr, Oliver Rübel, Gunther H Weber

View presentation: 2022-10-16T19:00:00Z GMT-0600 Change your timezone on the schedule page
2022-10-16T19:00:00Z
Exemplar figure, but none was provided by the authors

The live footage of the talk, including the Q&A, can be viewed on the session page, LDAV: Topology & Ensembles.

Abstract

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.