Memory-Efficient Order-Independent Transparency with Dynamic Fragment Buffer

Order-independent transparency (OIT) rendering is computationally intensive due to required sorting and sufficient memory to store fragments before sorting. We present Dynamic Fragment Buffer, a revamped two-pass OIT rendering technique, which performs correct blending of a large number of transpare...

Full description

Saved in:
Bibliographic Details
Published in2012 25th SIBGRAPI Conference on Graphics, Patterns and Images pp. 134 - 141
Main Authors Maule, M., Comba, J. L. D., Torchelsen, R., Bastos, R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2012
Subjects
Buffer storage
Geometry
Graphics processing units
Indexes
Memory management
Order-Independent Transparency
Rendering (computer graphics)
Sorting
Online AccessGet full text

Cover

More Information
Summary:Order-independent transparency (OIT) rendering is computationally intensive due to required sorting and sufficient memory to store fragments before sorting. We present Dynamic Fragment Buffer, a revamped two-pass OIT rendering technique, which performs correct blending of a large number of transparent layers at interactive frame rates. Our approach self-adjusts memory allocation to handle a variable number of fragments per pixel without wasting memory. In this paper we perform a detailed analysis of several design decisions which lead to this technique. We present a collection of experiments that illustrate the advantages of our technique with respect to others OIT algorithms in the literature.
ISBN:1467328022
9781467328029
ISSN:1530-1834
2377-5416
DOI:10.1109/SIBGRAPI.2012.27