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

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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on visualization and computer graphics Vol. 20; no. 2; pp. 238 - 248
Main Author:	Zhang, Nan
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.02.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Computer graphics Error analysis error checking code graphics processor Hazards memory hazard Processors Rendering Rendering (computer graphics) Sorting algorithms Streams Transparency rendering visibility sort Visualization Volume measurements volume visualization
ISSN:	1077-2626, 1941-0506, 1941-0506
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!