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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on visualization and computer graphics Ročník 20; číslo 2; s. 238 - 248
Hlavný autor:	Zhang, Nan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.02.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!