Z-buffer Algorithms
Z-Buffer Algorithms is a visibility determination method in computer graphics that resolves depth conflicts by maintaining a depth buffer to store the closest z-value at each pixel, thereby enabling correct occlusion through per-pixel depth comparison during rasterization.
29
Publications
2.4K
Citations
57
Authors
27
Institutions
Publications per year
2017–2026
0
Variants
Z-buffering
Parents
29
Hanspeter Pfister, Matthias Zwicker, Jeroen van Baar · 2000 · 826 citations · Full text
The A -buffer, an antialiased hidden surface method
Loren Carpenter · 1984 · 349 citations
A parallel algorithm for polygon rasterization
Juan A. Pineda · ACM SIGGRAPH Computer Graphics · 1988 · 169 citations
The randomized z-buffer algorithm
Michael Wand, Matthias Fischer, Ingmar Peter et al. · 2001 · 127 citations
Generation and display of geometric fractals in 3-D
Alan Norton · ACM SIGGRAPH Computer Graphics · 1982 · 103 citations · Full text
1–5 of 29
57
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 57
27
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
283 citations
Apollo Instruments (United States)
Irvine, United States
2 h-index
2 publications
249 citations

Zuse Institute Berlin
Berlin, Germany
1 h-index
2 publications
108 citations
Stanford University
Stanford, United States
1 h-index
1 publications
15 citations

École Normale Supérieure de Lyon
Lyon, France
1 h-index
2 publications
24 citations

University of Rochester
Rochester, United States
1 h-index
2 publications
156 citations
Fujifilm (Japan)
Tokyo, Japan
1 h-index
1 publications
349 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
14 citations
1–8 of 27
3 publications · 108 citations
3
h-index
2 publications · 272 citations
2
h-index
TOG · 1 publications · 68 citations
1
h-index
Conference · 1 publications · 25 citations
1
h-index
Repository · 1 publications · 13 citations
1
h-index
1–5