Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1145/1064092.1064151 | Symposium on Computational Geometry 2013 |
Keywords | Field | DocType |
scientific datasets,time-varying function,time-varying contour tree,critical points,critical point,computational topology,level sets,level set,morse function | Discrete mathematics,Combinatorics,Computer science,Combinatorial algorithms,Level set,Contour tree,restrict | Conference |
ISBN | Citations | PageRank |
1-58113-991-8 | 1 | 0.36 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajith Mascarenhas | 1 | 241 | 8.65 |
| Jack Snoeyink | 2 | 2842 | 231.68 |