Real‐Time Concurrent Linked List Construction on the GPU
Authors:
- 1 June 2010
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (4) , 1297-1304
Abstract
We introduce a method to dynamically construct highly concurrent linked lists on modern graphics processors. Once constructed, these data structures can be used to implement a host of algorithms useful in creating complex rendering effects in real time. We present a straightforward way to create these linked lists using generic atomic operations available in APIs such as OpenGL 4.0 and DirectX 11. We also describe several possible applications of our algorithm. One example uses per‐pixel linked lists for order‐independent transparency; as a consequence, we are able to directly implement fully programmable blending, which frees developers from the restrictions imposed by current graphics APIs. The second uses linked lists to implement real‐time indirect shadows.Keywords
This publication has 20 references indexed in Scilit:
- Cascaded light propagation volumes for real-time indirect illumination2010
- Approximating dynamic global illumination in image space2009
- Imperfect shadow maps for efficient computation of indirect illuminationACM Transactions on Graphics, 2008
- Multi-fragment effects on the GPU using the k -buffer2007
- Ray tracing animated scenes using coherent grid traversal2006
- Splatting indirect illumination2006
- The irregular Z-bufferACM Transactions on Graphics, 2005
- Hardware-Assisted Visibility Sorting for Unstructured Volume RenderingIEEE Transactions on Visualization and Computer Graphics, 2005
- R-buffer2001
- The A -buffer, an antialiased hidden surface methodACM SIGGRAPH Computer Graphics, 1984