Depth Sorting

Depth Sorting is a computational method in computer graphics that belongs to the class of hidden line removal techniques, distinguished by its strategy of ordering surfaces or objects according to their depth coordinates relative to the viewer to determine visibility.

21

Publications

990

Citations

57

Authors

30

Institutions

Publications per year

2017–2026

1

Authors

57

  1. CG
    Carl Gribel

    Lund University, Sweden

    2 publications · 48 citations

    2

    h-index

  2. WD
    William Dungan

    Technology Service Corporation (United States), United States

    2 publications · 35 citations

    2

    h-index

  3. AO
    A. Okamoto

    Tohoku University, Japan

    2 publications · 48 citations

    2

    h-index

  4. LG
    Leonidas Guibas

    Stanford University, United States

    2 publications · 81 citations

    2

    h-index

  5. RP
    Richard Pollack

    Courant Institute of Mathematical Sciences, United States

    2 publications · 81 citations

    2

    h-index

1–5 of 57

Venues

  1. ACM Transactions on Graphics

    TOG · 2 publications · 32 citations

    2

    h-index

  2. ACM SIGGRAPH Computer Graphics

    2 publications · 57 citations

    2

    h-index

  3. 2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 10 citations

    1

    h-index

  5. Computational Geometry

    1 publications · 70 citations

    1

    h-index

1–5