Contour Trees
Contour Trees is a topological data structure that encodes the connectivity evolution of level sets in a scalar field by representing the splitting and merging of contours across all possible isovalue thresholds.
56
Publications
3.2K
Citations
114
Authors
75
Institutions
Publications per year
2017–2026
9
56
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
Julien Tierny, Guillaume Favelier, Joshua A. Levine et al. · IEEE Transactions on Visualization and Computer Graphics · 2017 · 207 citations · Full text
Computing contour trees in all dimensions
Hamish Carr, Jack Snoeyink, Ulrike Axen · 2000 · 90 citations
1–5 of 56
114
8
h-index
6
h-index
5
h-index
4
h-index
University of North Carolina at Chapel Hill, United States
3 publications · 745 citations
3
h-index
1–5 of 114
75

Indian Institute of Science Bangalore
Bengaluru, India
6 h-index
13 publications
607 citations

University of Leeds
Leeds, United Kingdom
4 h-index
6 publications
223 citations

Sorbonne Université
Paris, France
4 h-index
11 publications
975 citations
LIP6
Paris, France
3 h-index
6 publications
745 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
3 publications
745 citations

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

Centre National de la Recherche Scientifique
Paris, France
3 h-index
7 publications
301 citations
University of Utah
Salt Lake City, United States
3 h-index
5 publications
344 citations
1–8 of 75
TVCG · 13 publications · 811 citations
13
h-index
4 publications · 148 citations
4
h-index
3 publications · 72 citations
3
h-index
2 publications · 131 citations
2
h-index
Repository · 2 publications · 74 citations
2
h-index
1–5