Related Experiment Video
Updated: Jun 16, 2026

Development of a Gaze-Contingent Display Framework Designed for Perceptual and Oculomotor Research with Simulated Central Vision Loss
Published on: April 11, 2025
Memory-hazard-aware k-buffer algorithm for order-independent transparency rendering
1Xi'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.
Related Concept Videos
Buffer Effectiveness
The buffer capacity is the amount of acid or base that can be added to a given volume...
Buffers: Overview
Buffers: Buffer Capacity
In the graph, pH is plotted as a function of the number of moles of base (Cb) added to a weak acid...
Buffers
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Forgetting
Encoding...

