Implementing time-varying contour trees

Authors:
Ajith Mascarenhas;Jack Snoeyink
Affiliations:
University of North Carolina at Chapel Hill, Chapel Hill, NC;University of North Carolina at Chapel Hill, Chapel Hill, NC
Venue:
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Year:
2005

Citing 2
Cited 1

Computing contour trees in all dimensions

Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Time-varying reeb graphs for continuous space-time data

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

Modeling and visualization of time-varying topology transitions guided by Hyper Reeb Graph structures

CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging

Quantified Score

Hi-index	0.00

Visualization

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.