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
Parents
21
Interactive Order-Independent Transparency
Cass Everitt · 2001 · 391 citations
Counting and cutting cycles of lines and rods in space
Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas et al. · Computational Geometry · 1992 · 70 citations
Efficient depth peeling via bucket sort
Fang Liu, Mengcheng Huang, Xuehui Liu et al. · 2009 · 55 citations
A linear time exact hidden surface algorithm
Wm. Randolph Franklin · 1980 · 44 citations
1–5 of 21
57
2
h-index
Technology Service Corporation (United States), United States
2 publications · 35 citations
2
h-index
2
h-index
2
h-index
Courant Institute of Mathematical Sciences, United States
2 publications · 81 citations
2
h-index
1–5 of 57
30

Lund University
Lund, Sweden
2 h-index
6 publications
144 citations
Princeton University
Princeton, United States
2 h-index
2 publications
81 citations
Intel (United States)
Santa Clara, United States
2 h-index
2 publications
48 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
4 publications
162 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
81 citations
New York University
New York, United States
2 h-index
4 publications
162 citations
Rensselaer Polytechnic Institute
Troy, United States
2 h-index
2 publications
85 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
81 citations
1–8 of 30
TOG · 2 publications · 32 citations
2
h-index
2 publications · 57 citations
2
h-index
2 publications · 48 citations
2
h-index
1 publications · 10 citations
1
h-index
1 publications · 70 citations
1
h-index
1–5