Contour Tree Analysis
Contour Tree Analysis is a computational method in scalar field topology that encodes the evolution of level-set connectivity across all possible isovalue thresholds by constructing a graph-based representation of merging and splitting contours in the domain.
37
Publications
2.5K
Citations
102
Authors
61
Institutions
Publications per year
2017–2026
11
37
Computing contour trees in all dimensions
Hamish Carr, Jack Snoeyink, Ulrike Axen · Computational Geometry · 2002 · 460 citations
Contour trees and small seed sets for isosurface traversal
Marc van Kreveld, René van Oostrum, Chandrajit Bajaj et al. · 1997 · 310 citations · Full text
1–5 of 37
102
9
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 102
61

University of Leeds
Leeds, United Kingdom
5 h-index
8 publications
317 citations

East China Normal University
Shanghai, China
4 h-index
15 publications
2.1K citations
Binghamton University
Binghamton, United States
4 h-index
4 publications
430 citations
University of California, Davis
Davis, United States
4 h-index
5 publications
397 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
3 publications
650 citations

University of British Columbia
Vancouver, Canada
3 h-index
3 publications
650 citations

University of Cincinnati
Cincinnati, United States
3 h-index
9 publications
942 citations

Lawrence Livermore National Laboratory
Livermore, United States
3 h-index
3 publications
499 citations
1–8 of 61
TVCG · 6 publications · 343 citations
6
h-index
3 publications · 641 citations
3
h-index
JAG · 2 publications · 111 citations
2
h-index
2 publications · 59 citations
2
h-index
2 publications · 131 citations
2
h-index
1–5