Implementing time-varying contour trees

ABSTRACT

In this video, we describe our experiences in implementing an algo-rithm to compute time-varying contour trees and highlight the chal-lenges in applying this algorithm to real-world scientific datasets. For ease of illustration we restrict our explanations to contour trees of time-varying functions defined on the plane.

REFERENCES

• 1: Hamish Carr , Jack Snoeyink , Ulrike Axen, Computing contour trees in all dimensions, Computational Geometry: Theory and Applications, v.24 n.2, p.75-94, February 2003 [doi>10.1016/S0925-7721(02)00093-7]
• 2: H. EDELSBRUNNER AND J. HARER. Jacobi sets of multiple Morse functions. In Foundations of Comp. Math., ed. F. Cucker, Cambridge Univ. Press, England, to appear.
• 3: Herbert Edelsbrunner , John Harer , Ajith Mascarenhas , Valerio Pascucci, Time-varying reeb graphs for continuous space-time data, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA [doi>10.1145/997817.997872]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.5 Computational Geometry and Object Modeling

General Terms:
Algorithms, Theory

Keywords:
Morse functions, combinatorial algorithms, contour tree, critical points, differential and computational topology, level sets, triangulations