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

Authors

57

  1. SJ
    Sabu John

    RMIT University, Australia

    3 publications · 65 citations

    3

    h-index

  2. NS
    Nigel Stewart

    RMIT University, Australia

    3 publications · 65 citations

    3

    h-index

  3. GL
    Geoff Leach

    RMIT University, Australia

    3 publications · 65 citations

    3

    h-index

  4. JA
    Juan A. Pineda

    Hospital Universitario de Valme, Spain

    2 publications · 249 citations

    2

    h-index

  5. AN
    Alan Norton

    IBM (United States), United States

    2 publications · 205 citations

    2

    h-index

1–5 of 57

Venues

  1. IEEE Computer Graphics and Applications

    3 publications · 108 citations

    3

    h-index

  2. ACM SIGGRAPH Computer Graphics

    2 publications · 272 citations

    2

    h-index

  3. ACM Transactions on Graphics

    TOG · 1 publications · 68 citations

    1

    h-index

  4. 1

    h-index

  5. Digital Library (University of West Bohemia)

    Repository · 1 publications · 13 citations

    1

    h-index

1–5