Format

Send to

Choose Destination
IEEE Trans Vis Comput Graph. 2013 Apr 4. [Epub ahead of print]

Memory-Hazard-Aware K-Buffer Algorithm for Order-Independent Transparency Rendering.

Author information

1
Xi'an Jiaotong University, China, Tsinghua University, China and Stony Brook University, USA.

Abstract

The k-buffer algorithm is an efficient GPU based fragment level sorting algorithm for rendering transparent surfaces. Because of the inherent massive parallelism of GPU stream processors, this algorithm suffers serious read-after-write memory hazards now. In this paper, we introduce an improved k-buffer algorithm with error correction coding to combat memory hazards. Our algorithm results in significantly reduced artifacts. While preserving all the merits of the original algorithm, it requires merely OpenGL 3.x support from the GPU, instead of the atomic operations appearing only in the latest OpenGL 4.2 standard. Our algorithm is simple to implement and efficient in performance. Future GPU support for improving this algorithm is also proposed.

Supplemental Content

Full text links

Icon for IEEE Engineering in Medicine and Biology Society
Loading ...
Support Center