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

Authors

114

  1. HC
    Hamish Carr

    University of Leeds, United Kingdom

    8 publications · 942 citations

    8

    h-index

  2. VN
    Vijay Natarajan

    Indian Institute of Science Bangalore, India

    6 publications · 283 citations

    6

    h-index

  3. JT
    Julien Tierny

    Centre National de la Recherche Scientifique, France

    5 publications · 424 citations

    5

    h-index

  4. CG
    Charles Gueunet

    Sorbonne Université, France

    4 publications · 338 citations

    4

    h-index

  5. JS
    Jack Snoeyink

    University of North Carolina at Chapel Hill, United States

    3 publications · 745 citations

    3

    h-index

1–5 of 114

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 13 publications · 811 citations

    13

    h-index

  2. Computer Graphics Forum

    4 publications · 148 citations

    4

    h-index

  3. Pattern Recognition

    3 publications · 72 citations

    3

    h-index

  4. 2

    h-index

  5. 2

    h-index

1–5