Simple and optimal output-sensitive construction of contour trees using monotone paths

Computational Geometry: Theory and Applications

Volumn 30, Issue 2 SPEC. ISS., 2005, Pages 165-195

  Chiang, Yi Jen ^a   Lenz, Tobias ^b   Lu, Xiang ^a   Rote, Günter ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Computational topology; Level sets; Piecewise linear Morse theory

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; DATA HANDLING; DATA MINING; DATA VISUALIZATION; FORESTRY; PIECEWISE LINEAR TECHNIQUES; TOPOLOGY;

COMPUTATIONAL TOPOLOGY; CONTOUR TREES; HIGH DIMENSIONAL DATA; ISO-CONTOURS; LEVEL SET; MONOTONE PATHS; MORSE THE-ORY; OUTPUT-SENSITIVE;

TREES (MATHEMATICS);

EID: 10044238852     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.05.002     Document Type: Conference Paper

References (41)

1. J.W. Alexander On the subdivision of 3-space by a polyhedron Proc. Nat. Acad. Sci. (USA) 10 1924 6 8
2. C. Bajaj, V. Pascucci, and D. Schikore The contour spectrum Proc. IEEE Visualization 1997 167 175
3. C. Bajaj, M. van Kreveld, R. van Oostrum, V. Pascucci, D.R. Schikore, Contour trees and small seed sets for isosurface traversal, Tech. Rep. UU-CS-1998-25, Department of Computer Science, Utrecht University, 1998
4. T.F. Banchoff Critical points and curvature for embedded polyhedra J. Differential. Geom. 1 1967 245 256
5. T.F. Banchoff Critical points and curvature for embedded polyhedral surfaces Amer. Math. Monthly 77 1970 475 485
6. U. Brehm, and W. Kühnel Combinatorial manifolds with few vertices Topology 26 1987 465 473
7. H. Carr, and J. Snoeyink Path seeds and flexible isosurfaces - using topology for exploratory visualization G.-P. Bonneau, S. Hahmann, C.D. Hansen, Proc. Joint Eurographics - IEEE TCVG Sympos. Visualization (VisSym '03) 2003 Eurographics Association 49 58 and 285
8. H. Carr, J. Snoeyink, and U. Axen Computing contour trees in all dimensions Computational Geometry 24 2003 75 94
9. Y.-J. Chiang, and X. Lu Progressive simplification of tetrahedral meshes preserving all isosurface topologies Computer Graphics Forum (Special Issue for Eurographics '03) 22 3 2003 493 504
10. Y.-J. Chiang, X. Lu, Simple and optimal output-sensitive computation of contour trees, Tech. Rep. TR-CIS-2003-02, Department of Computer and Information Science, Polytechnic University, 2003
11. K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci Loops in Reeb graphs of 2-manifolds Proc. 19th Ann. Sympos. Comput. Geom. 2003 ACM Press 344 350
12. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 MIT Press Cambridge, MA
13. J. Cox, D.B. Karron, and N. Ferdous Topological zone organization of scalar volume data J. Math. Imag. Vision 18 2003 95 117
14. M. de Berg, and M. van Kreveld Trekking in the Alps without freezing or getting tired Algorithmica 18 1997 306 323
15. H. Edelsbrunner, J. Harer, and A. Zomorodian Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds Discr. Comput. Geom. 30 2003 87 107
16. A.T. Fomenko, and T.L. Kunii Topological Modeling for Visualization 1997 Springer-Verlag
17. T. Gerstner, and R. Pajarola Topology preserving and controlled topology simplifying multiresolution isosurface extraction Proc. IEEE Visualization 2000 259 266
18. L.C. Glaser Geometrical Combinatorial Topology vol. I 1970 van Nostrand Reinhold New York
19. T. He, L. Hong, A. Varshney, and S. Wang Controlled topology simplification IEEE Transactions on Visualization and Computer Graphics 2 2 1996 171 184
20. L. Kettner, J. Rossignac, and J. Snoeyink The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra Computational Geometry 25 2003 97 116
21. L. Kettner, and J. Snoeyink A prototype system for visualizing time-dependent volume data Proc. 17th Ann. Symp. Computational Geometry 2001 ACM Press 327 328
22. A. Kosinski Singularities of piecewise linear mappings, I. Mappings into the real line Bull. Amer. Math. Soc. 68 1962 110 114
23. W. Kühnel Triangulations of manifolds with few vertices F. Triceri, Advances in Differential Geometry and Topology 1990 World Scientific 59 114
24. N.H. Kuiper Morse relations for curvature and tightness C.T.C. Wall, Proc. Liverpool Singularities Symposium II Lecture Notes in Mathematics vol. 209 1971 Springer-Verlag 77 89
25. T. Lenz, Efficient construction of contour trees using monotonic paths, Diplomarbeit (M.Sc. thesis), Institut für Informatik, Freie Universität, Berlin, August 2002
26. G.L. Miller, S.-H. Teng, W. Thurston, and S.A. Vavasis Automatic mesh partitioning A. George, J.R. Gilbert, J.W.-H. Liu, Sparse Matrix Computations: Graph Theory Issues and Algorithms 1993 Institute for Mathematics and its Applications, Springer-Verlag 57 84
27. G.L. Miller, S.-H. Teng, W. Thurston, and S.A. Vavasis Geometric separators for finite-element meshes SIAM J. Sci. Comput. 19 1995 364 386
28. J.W. Milnor Morse Theory 1963 Princeton University Press Princeton
29. M. Morse Topologically non-degenerate functions on a compact n-manifold J. Analyse Math. 7 1959 189 208
30. V. Pascucci On the topology of the level sets of a scalar field T. Biedl, Proc. 13th Canad. Conf. Comput. Geom. (CCCG 2001) 2001 University of Waterloo Ontario, Canada 141 144 http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/
31. V. Pascucci, On the topology of the level sets of a scalar field, Tech. Rep. UCRL-JC-142262, Lawrence Livermore National Laboratory, February 2001
32. V. Pascucci, and K. Cole-McLaughlin Efficient computation of the topology of level sets Proc. IEEE Visualization 2002 187 194 Full version: Parallel computation of the topology of level sets, Algorithmica 38 (2004) 249-268
33. W. Schroeder, W. Lorensen, and C. Linthicum Implicit modeling of swept surfaces and volumes IEEE Visualization '94 1994 40 45
34. W. Schroeder, K. Martin, and W. Lorensen The Visualization Toolkit 1996 Prentice-Hall
35. Y. Shinagawa, T.L. Kunii, and Y.L. Kergosien Surface coding based on Morse theory IEEE Comput. Graph. Appl. 11 1991 66 78
36. S. Takahashi, T. Ikeda, Y. Shinagawa, T.L. Kunii, and M. Ueda Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data Computer Graphics Forum 14 4 1995 C181 C192
37. S. Takahashi, Y. Takeshima, I. Fujishiro, Topological volume skeletonization and its application to transfer function design, Tech. Rep. OCHA-IS 2000-3, Department of Information Sciences, Faculty of Science, Ochanomizu University, Ochanomizu, Japan, February 2001
38. S.P. Tarasov, and M.N. Vyalyi Construction of contour trees in 3D in O (nlogn) steps Proc. 14th Ann. Sympos. Comput. Geom. 1998 68 75
39. R.E. Tarjan Efficiency of a good but not linear set union algorithm J. Assoc. Comput. Mach. 22 1975 215 225
40. W.T. Tutte How to draw a graph Proc. London Math. Soc., III Ser. 13 52 1963 743 768
41. M. van Kreveld, R. van Oostrum, C.L. Bajaj, V. Pascucci, and D. Schikore Contour trees and small seed sets for isosurface traversal Proc. 13th Ann. Sympos. Comput. Geom. 1997 212 220