Distributed Contour Trees
Topological techniques provide robust tools for data analysis. They are used, for example, for feature extraction, for data de-noising, and for comparison of data sets. This chapter concerns contour trees, a topological descriptor that records the connectivity of the isosurfaces of scalar functions. These trees are fundamental to analysis and visualization of physical phenomena modeled by real-valued measurements.
We study the parallel analysis of contour trees. After describing a particular representation of a contour tree, called local–global representation, we illustrate how different problems that rely on contour trees can be solved in parallel with minimal communication.
KeywordsLocal Domain Global Representation Topological Descriptor Smale Complex Reeb Graph
This work was supported by the Director, Office of Advanced Scientific Computing Research, Office of Science, of the U.S. DOE under Contract No. DE-AC02-05CH11231 (Lawrence Berkeley National Laboratory) through the grant “Topology-based Visualization and Analysis of High-dimensional Data and Time-varying Data at the Extreme Scale,” program manager Lucy Nowell.
- 1.L. Arge, M. Revsbaek, I/O-efficient contour tree simplification, in Proceedings of the International Symposium on Algorithms and Computation, Honolulu. LNCS 5878 (Springer, Berlin/Heidelberg, 2009), pp. 1155–1165Google Scholar
- 5.H. Childs, E. Brugger, B. Whitlock, J. Meredith, S. Ahern, D. Pugmire, K. Biagas, M. Miller, C. Harrison, G.H. Weber, H. Krishnan, T. Fogal, A. Sanderson, C. Garth, E.W. Bethel, D. Camp, O. Rübel, M. Durant, J.M. Favre, P. Navrátil, VisIt: an end-user tool for visualizing and analyzing very large data, in High Performance Visualization—Enabling Extreme-Scale Scientific Insight (CRC, Hoboken, 2012), pp. 357–372Google Scholar
- 6.H. Edelsbrunner, J. Harer, Persistent Homology—A survey. Volume 453 of Contemporary Mathematics (AMS, Providence, 2008), pp. 257–282Google Scholar
- 7.A. Gyulassy, V. Pascucci, T. Peterka, R. Ross, The parallel computation of Morse–Smale complexes, in IEEE IPDPS, Shanghai, 2012, pp. 484–495Google Scholar
- 8.C. Harrison, H. Childs, K.P. Gaither, Data-parallel mesh connected components labeling and analysis, in Proceedings of the 11th EG PGV, Switzerland, 2011, pp. 131–140Google Scholar
- 9.M. Hilaga, Y. Shinagawa, T. Kohmura, T.L. Kunii, Topology matching for fully automatic similarity estimation of 3D shapes, in Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH ’01, Los Angeles, 2001, pp. 203–212Google Scholar
- 14.D. Morozov, G.H. Weber, Distributed merge trees, in Proceedings of the ACM Symposium Principles and Practice of Parallel Programming, Shenzhen, 2013, pp. 93–102Google Scholar
- 17.T. Peterka, D. Goodell, R. Ross, H.-W. Shen, R. Thakur, A configurable algorithm for parallel image-compositing applications, in Proceedings of the SC, Portland, 2009, pp. 4:1–4:10Google Scholar
- 22.M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, D. Schikore, Contour trees and small seed sets for isosurface traversal, in Proceedings of the Annual Symposium Computational Geometry, New York, 1997, pp. 212–220Google Scholar
- 23.G.H. Weber, P.-T. Bremer, M.S. Day, J.B. Bell, V. Pascucci, Feature tracking using reeb graphs, in Topological Methods in Data Analysis and Visualization: Theory, Algorithms, and Applications (Springer, Berlin/Heidelberg, 2011) pp. 241–253Google Scholar