Memory-optimized order-independent transparency with Dynamic Fragment Buffer

被引：4

作者：

Maule, Marilena ^{[1
]}

Comba, Joao L. D. ^{[1
]}

Torchelsen, Rafael ^{[2
]}

Bastos, Rui ^{[3
]}

机构：

[1] Inst Informat UFRGS, Porto Alegre, RS, Brazil

[2] UFFS, Chapeco, SC, Brazil

[3] NVIDIA, Santa Clara, CA USA

来源：

COMPUTERS & GRAPHICS-UK | 2014年 / 38卷

关键词：

Order-independent transparency;

D O I：

10.1016/j.cag.2013.07.006

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Exact order-independent transparency (OIT) rendering is memory demanding because it requires perpixel blending of an unknown number of fragments that need to be stored and sorted before compositing. In this paper, we describe the Dynamic Fragment Buffer (DFB) algorithm, which efficiently manages memory to perform correct compositing for pixels with varying numbers of fragments. We present a collection of experiments that illustrate the advantages of the DFB algorithm with respect to other OIT algorithms, and analyze the impact of the proposed variations. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：1 / 9

页数：9

共 12 条

[1]

Bavoil L, 2007, I3D 2007: ACM SIGGRAPH SYMPOSIUM ON INTERACTIVE 3D GRAPHICS AND GAMES, PROCEEDINGS, P97

[2]

Carpenter L., 1984, Computers & Graphics, V18, P103

[3]

Crassin C, 2010, PAGED PER PIXEL LINK

[4]

Crassin C., 2010, FAST ACCURATE SINGLE

[5]

Jouppi N. P., 1999, Proceedings 1999 EUROGRAPHICS/SIGGRAPH Workshop on Graphics Hardware, P85, DOI 10.1145/311534.311582

[6]

Knowles P, 2012, OPENGL INSIGHTS, P279

[7]

Liu F., 2010, FREEPIPE PROGR PAR R, P75, DOI [DOI 10.1145/1730804, DOI 10.1145/1730804.1730817]

[8]

Maule M, 2012, P 25 SIBGRAPI C GRAP

[9] A survey of raster-based transparency techniques [J].

Maule, Marilena ;

Comba, Joao L. D. ;

Torchelsen, Rafael P. ;

Bastos, Rui .

COMPUTERS & GRAPHICS-UK, 2011, 35 (06) :1023-1034

[10]

Salvi Marco., 2011, PROC ACM SIGGRAPH S, P119, DOI [10.1145/2018323.2018342, DOI 10.1145/2018323.2018342]

← 1 2 →