메뉴 건너뛰기




Volumn 41, Issue 3, 2008, Pages 149-166

Time-varying Reeb graphs for continuous space-time data

Author keywords

Combinatorial algorithms; Critical points; Differential and computational topology; Level sets; Morse functions; Reeb graph; Triangulations

Indexed keywords


EID: 84867965784     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.11.001     Document Type: Article
Times cited : (51)

References (26)
  • 4
    • 0001685025 scopus 로고
    • Critical points for embedded polyhedral surfaces
    • T.F. Banchoff Critical points for embedded polyhedral surfaces Amer. Math. Monthly 77 1970 457 485
    • (1970) Amer. Math. Monthly , vol.77 , pp. 457-485
    • Banchoff, T.F.1
  • 5
    • 0034449079 scopus 로고    scopus 로고
    • Case study: A methodology for plume visualization with application to real-time acquisition and navigation
    • K.G. Bemis, D. Silver, P.A. Rona, C. Feng, Case study: a methodology for plume visualization with application to real-time acquisition and navigation, in: Proc. IEEE Conf. Visualization, 2000, pp. 481-494
    • (2000) Proc. IEEE Conf. Visualization , pp. 481-494
    • Bemis, K.G.1    Silver, D.2    Rona, P.A.3    Feng, C.4
  • 6
    • 77951693926 scopus 로고    scopus 로고
    • Computing contour trees in all dimensions
    • H. Carr, J. Snoeyink, and U. Axen Computing contour trees in all dimensions Comput. Geom. 24 2 2003 75 94
    • (2003) Comput. Geom. , vol.24 , Issue.2 , pp. 75-94
    • Carr, H.1    Snoeyink, J.2    Axen, U.3
  • 7
    • 11144310061 scopus 로고    scopus 로고
    • Path seeds and flexible isosurfaces: Using topology for exploratory visualization
    • H. Carr, J. Snoeyink, Path seeds and flexible isosurfaces: Using topology for exploratory visualization, in: Proc. of Eurographics Vis. Sympos. 2003, 2003, pp. 49-58
    • (2003) Proc. of Eurographics Vis. Sympos. 2003 , pp. 49-58
    • Carr, H.1    Snoeyink, J.2
  • 8
    • 10044238852 scopus 로고    scopus 로고
    • Simple and optimal output-sensitive construction of contour trees using monotone paths
    • Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote Simple and optimal output-sensitive construction of contour trees using monotone paths Comp. Geom. Theory Appl. 30 2 2005 165 195
    • (2005) Comp. Geom. Theory Appl. , vol.30 , Issue.2 , pp. 165-195
    • Chiang, Y.-J.1    Lenz, T.2    Lu, X.3    Rote, G.4
  • 9
    • 84862961852 scopus 로고    scopus 로고
    • A parallel pipelined renderer for time-varying volume data
    • T. Chiueh, K.-L. Ma, A parallel pipelined renderer for time-varying volume data, in: Proc. Parallel Arch., Alg., Networks, 1997, pp. 9-15
    • (1997) Proc. Parallel Arch., Alg., Networks , pp. 9-15
    • Chiueh, T.1    Ma, K.-L.2
  • 11
    • 10044257064 scopus 로고
    • An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
    • C.J.A. Delfinado, and H. Edelsbrunner An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere Comput. Aided Geom. Design 12 1995 771 784
    • (1995) Comput. Aided Geom. Design , vol.12 , pp. 771-784
    • Delfinado, C.J.A.1    Edelsbrunner, H.2
  • 13
    • 17044398347 scopus 로고    scopus 로고
    • Jacobi sets of multiple Morse functions
    • F. Cucker, Cambridge Univ. Press England
    • H. Edelsbrunner, and J. Harer Jacobi sets of multiple Morse functions F. Cucker, Foundations of Computational Mathematics 2004 Cambridge Univ. Press England 37 57
    • (2004) Foundations of Computational Mathematics , pp. 37-57
    • Edelsbrunner, H.1    Harer, J.2
  • 18
    • 0038792755 scopus 로고    scopus 로고
    • Translated from Japanese by K. Hudson and M. Saito Amer. Math. Soc.
    • Y. Matsumoto An Introduction to Morse Theory Translated from Japanese by K. Hudson and M. Saito 2002 Amer. Math. Soc.
    • (2002) An Introduction to Morse Theory
    • Matsumoto, Y.1
  • 20
    • 0004190360 scopus 로고
    • Princeton Univ. Press NJ
    • J. Milnor Morse Theory 1963 Princeton Univ. Press NJ
    • (1963) Morse Theory
    • Milnor, J.1
  • 22
    • 21144442545 scopus 로고    scopus 로고
    • Parallel computation of the topology of level sets
    • V. Pascucci, and K. Cole-McLaughlin Parallel computation of the topology of level sets Algorithmica 38 2 2003 249 268
    • (2003) Algorithmica , vol.38 , Issue.2 , pp. 249-268
    • Pascucci, V.1    Cole-Mclaughlin, K.2
  • 23
    • 0001647901 scopus 로고
    • Sur les points singuliers d'une forme de Pfaff complètement intégrable ou d'une fonction numérique
    • G. Reeb Sur les points singuliers d'une forme de Pfaff complètement intégrable ou d'une fonction numérique Comptes Rendus de L'Académie ses Séances, Paris 222 1946 847 849
    • (1946) Comptes Rendus de l'Académie Ses Séances, Paris , vol.222 , pp. 847-849
    • Reeb, G.1
  • 24
    • 0002165618 scopus 로고
    • Constructing a Reeb graph automatically from cross sections
    • Y. Shinagawa, and T.L. Kunii Constructing a Reeb graph automatically from cross sections IEEE Comput. Graphics Appl. 11 1991 44 51
    • (1991) IEEE Comput. Graphics Appl. , vol.11 , pp. 44-51
    • Shinagawa, Y.1    Kunii, T.L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.