“Toward Efficient and Accurate Order-Independent Transparency” by Kerzner, Wyman, Butler and Gribble

  • ©Ethan Kerzner, Chris Wyman, Lee A. Butler, and Christiaan Gribble



Entry Number: 102


    Toward Efficient and Accurate Order-Independent Transparency



    Correctly rendering multi-layered transparent geometry requires accumulating contributions from multiple fragments per pixel. Dynamic A-buffers (e.g., Yang et al’s [2010] per-pixel linked lists) achieve this by storing and sorting fragments on-the-fly. We introduce two improvements to recent GPU-based interactive A-buffer techniques. First, our redesigned algorithm uses fewer costly global atomic operations to construct linked lists. Second, we decouple visibility and shading to reduce memory demands of multi-fragment rendering.


    1. Liktor, G., and Dachsbacher, C. 2012. Decoupled deferred shading for hardware rasterization. 143–150.
    2. Vasilakis, A., and Fudos, I. 2012. S-buffer: Sparsity-aware multi-fragment rendering. Eurographics Symposium on Rendering.
    3. Yang, J., Hensley, J., Grun, H., and Thibieroz, N. 2010. Real-time concurrent linked list construction on the gpu. Computer Graphics Forum 29, 4, 1297–1304.



ACM Digital Library Publication:

Overview Page: