Article

Implementing time-varying contour trees

Authors:

Ajith Mascarenhas,

Jack SnoeyinkAuthors Info & Claims

SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

Pages 370 - 371

https://doi.org/10.1145/1064092.1064151

Published: 06 June 2005 Publication History

Get Access

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]

H. CARR, J.SNOEYINK AND U. AXEN. Computing contour trees in all dimensions. Comput. Geom. 24(2) (2003), 75--94.

Digital Library

Google Scholar

[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.

Google Scholar

[3]

H. EDELSBRUNNER, J. HARER, A. MASCARENHAS AND V. PASCUCCI Time-varying reeb graphs for continuous space-time data SCG '04: Proc. of the 20th annual symp. on Comp. geometry 366--372, 2004.

Digital Library

Google Scholar

Cited By

View all

Oesterling PHeine CWeber GMorozov DScheuermann G(2017)Computing and Visualizing Time-Varying Merge Trees for High-Dimensional DataTopological Methods in Data Analysis and Visualization IV10.1007/978-3-319-44684-4_5(87-101)Online publication date: 3-Jun-2017
https://doi.org/10.1007/978-3-319-44684-4_5
Heine CLeitte HHlawitschka MIuricich FDe Floriani LScheuermann GHagen HGarth C(2016)A Survey of Topology-based Methods in VisualizationComputer Graphics Forum10.5555/3071534.307159335:3(643-667)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.5555/3071534.3071593
Heine CLeitte HHlawitschka MIuricich FDe Floriani LScheuermann GHagen HGarth C(2016)A Survey of Topology‐based Methods in VisualizationComputer Graphics Forum10.1111/cgf.1293335:3(643-667)Online publication date: 4-Jul-2016
https://doi.org/10.1111/cgf.12933
Show More Cited By

Index Terms

Implementing time-varying contour trees
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Time-Varying Contour Topology

The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend ...
Drawing Contour Trees in the Plane

The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect ...
The JS-graphs of Join and Split Trees
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry

Let f be a continuous function defined on a topological space. As we increase the function value, connected components in the level set of f appear, disappear, merge, or split, and the Reeb graph tracks these changes. The join and split trees of f track ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

June 2005

398 pages

ISBN:1581139918

DOI:10.1145/1064092

Program Chairs:
Joe Mitchell
SUNY Stony Brook
,
Günter Rote
Freie Universität Berlin

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SoCG05

Sponsor:

SoCG05: The 21st Annual ACM Symposium on Computational Geometry 2005

June 6 - 8, 2005

Pisa, Italy

Acceptance Rates

SCG '05 Paper Acceptance Rate 41 of 141 submissions, 29%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
353
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Oesterling PHeine CWeber GMorozov DScheuermann G(2017)Computing and Visualizing Time-Varying Merge Trees for High-Dimensional DataTopological Methods in Data Analysis and Visualization IV10.1007/978-3-319-44684-4_5(87-101)Online publication date: 3-Jun-2017
https://doi.org/10.1007/978-3-319-44684-4_5
Heine CLeitte HHlawitschka MIuricich FDe Floriani LScheuermann GHagen HGarth C(2016)A Survey of Topology-based Methods in VisualizationComputer Graphics Forum10.5555/3071534.307159335:3(643-667)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.5555/3071534.3071593
Heine CLeitte HHlawitschka MIuricich FDe Floriani LScheuermann GHagen HGarth C(2016)A Survey of Topology‐based Methods in VisualizationComputer Graphics Forum10.1111/cgf.1293335:3(643-667)Online publication date: 4-Jul-2016
https://doi.org/10.1111/cgf.12933
Wei XJoneja ATian YYao Y(2014)Monotone Descent Path Queries on Dynamic TerrainsJournal of Computing and Information Science in Engineering10.1115/1.402578014:1(011008)Online publication date: 29-Jan-2014
https://doi.org/10.1115/1.4025780
Takahashi SFujishiro IOkada M(2009)Applying Manifold Learning to Plotting Approximate Contour TreesIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2009.11915:6(1185-1192)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1109/TVCG.2009.119

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Time-Varying Contour Topology

Drawing Contour Trees in the Plane

The JS-graphs of Join and Split Trees