<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<identifier>8JMKD3MGPBW34M/3CA8TTH</identifier>
		<repository>sid.inpe.br/sibgrapi/2012/07.17.13.55</repository>
		<lastupdate>2012:07.17.13.55.35 sid.inpe.br/banon/2001/03.30.15.38 mmaule@inf.ufrgs.br</lastupdate>
		<metadatarepository>sid.inpe.br/sibgrapi/2012/07.17.13.55.35</metadatarepository>
		<metadatalastupdate>2020:02.19.02.18.29 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2012}</metadatalastupdate>
		<citationkey>MauleCombTorcBast:2012:MeOrTr</citationkey>
		<title>Memory-Efficient Order-Independent Transparency with Dynamic Fragment Buffer</title>
		<format>DVD, On-line.</format>
		<year>2012</year>
		<numberoffiles>1</numberoffiles>
		<size>7870 KiB</size>
		<author>Maule, Marilena,</author>
		<author>Comba, Joćo Luiz Dihl,</author>
		<author>Torchelsen, Rafael,</author>
		<author>Bastos, Rui,</author>
		<affiliation>UFRGS</affiliation>
		<affiliation>UFRGS</affiliation>
		<affiliation>UFFS</affiliation>
		<affiliation>NVIDIA</affiliation>
		<editor>Freitas, Carla Maria Dal Sasso,</editor>
		<editor>Sarkar, Sudeep,</editor>
		<editor>Scopigno, Roberto,</editor>
		<editor>Silva, Luciano,</editor>
		<e-mailaddress>mmaule@inf.ufrgs.br</e-mailaddress>
		<conferencename>Conference on Graphics, Patterns and Images, 25 (SIBGRAPI)</conferencename>
		<conferencelocation>Ouro Preto</conferencelocation>
		<date>Aug. 22-25, 2012</date>
		<booktitle>Proceedings</booktitle>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<tertiarytype>Full Paper</tertiarytype>
		<transferableflag>1</transferableflag>
		<contenttype>External Contribution</contenttype>
		<keywords>Order-Independent Transparency.</keywords>
		<abstract>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.</abstract>
		<language>en</language>
		<targetfile>dfb.pdf</targetfile>
		<usergroup>mmaule@inf.ufrgs.br</usergroup>
		<visibility>shown</visibility>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<agreement>agreement.html .htaccess .htaccess2</agreement>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2012/07.17.13.55</url>
	</metadata>
</metadatalist>