Distributed contour trees

Mathematics and Visualization

Volumn 0, Issue 9783319040981, 2014, Pages 89-102

  Morozov, Dmitriy ^a   Weber, Gunther H ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

CONTOUR TREES; DATA DE-NOISING; DESCRIPTORS; GLOBAL REPRESENTATION; PARALLEL ANALYSIS; PHYSICAL PHENOMENA; SCALAR FUNCTION; TOPOLOGICAL TECHNIQUES;

FORESTRY;

EID: 85028743807     PISSN: 16123786     EISSN: 2197666X     Source Type: Book Series    
DOI: 10.1007/978-3-319-04099-8_6     Document Type: Chapter

References (24)

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-1165
2. H. Carr, J. Snoeyink, U. Axen, Computing contour trees in all dimensions. Comput. Geom. Theory Appl. 24(2), 75-94 (2003)
3. H. Carr, J. Snoeyink, M. van de Panne, Flexible isosurfaces: simplifying and displaying scalar topology using the contour tree. Comput. Geom. Theory Appl. 43(1), 42-58 (2010)
4. Y.-J. Chiang, X. Lu, Progressive simplification of tetrahedral meshes preserving all isosurface topologies. Comput. Graph. Forum 22(3), 493-504 (2003)
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. Navratil, 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-372
6. H. Edelsbrunner, J. Harer, Persistent Homology—A survey. Volume 453 of Contemporary Mathematics (AMS, Providence, 2008), pp. 257-282
7. A. Gyulassy, V. Pascucci, T. Peterka, R. Ross, The parallel computation of Morse-Smale complexes, in IEEE IPDPS, Shanghai, 2012, pp. 484-495
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-140
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-212
10. W. E. Lorensen, H.E. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21(4), 163-169 (1987)
11. K.-L. Ma, J.S. Painter, C.D. Hansen, M.F. Krogh, Parallel volume rendering using binary-swap compositing. IEEE Comput. Graph. Appl. 14(4), 59-68 (1994)
12. S. Molnar, M. Cox, D. Ellsworth, H. Fuchs, A sorting classification of parallel rendering. IEEE Comput. Graph. Appl. 14(4), 23-32 (1994)
13. C. Montani, R. Scateni, R. Scopigno, A modified look-up table for implicit disambiguation of marching cubes. Vis. Comput. 10(6), 353-355 (1994)
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-102
15. G. Nielson, On marching cubes. IEEE Trans. Vis. Comput. Graph. 9(3), 341-351 (2003)
16. V. Pascucci, K. Cole-McLaughlin, Parallel computation of the topology of level sets. Algorith-mica 38(1), 249-268 (2003)
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:10
18. G. Reeb, Sur les points singuliers d’une forme de pfaff complètement intégrable ou d’une fonction numérique. CR Acad. Sci. 222, 847-849 (1946)
19. N. Shivashankar, V. Natarajan, Parallel computation of 3D Morse-Smale complexes. Comput. Graph. Forum 31, 965-974 (2012)
20. N. Shivashankar, M. Senthilnathan, V. Natarajan, Parallel computation of 2D Morse-Smale complexes. IEEE Trans. Vis. Comput. Graph. 18(10), 1757-1770 (2012)
21. D.M. Ushizima, D. Morozov, G.H. Weber, A.G. Bianchi, J.A. Sethian, E.W. Bethel, Augmented topological descriptors of pore networks for material science. IEEE Trans. Vis. Comput. Graph. 18(12), 2041-2050 (2012)
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-220
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-253
24. G.H. Weber, S.E. Dillard, H. Carr, V. Pascucci, B. Hamann, Topology-controlled volume rendering. IEEE Trans. Vis. Comput. Graph. 13(2), 330-341 (2007)