Aggregate G-Buffer Anti-Aliasing -Extended Version-

We present Aggregate G-Buffer Anti-Aliasing (AGAA), a new technique for efficient anti-aliased deferred rendering of complex geometry using modern graphics hardware. In geometrically complex situations where many surfaces intersect a pixel, current rendering systems shade each contributing surface <italic>at least</italic> once per pixel. As the sample density and geometric complexity increase, the shading cost becomes prohibitive for real-time rendering. Under deferred shading, so does the required framebuffer memory. Our goal is to make high per-pixel sampling rates practical for real-time applications by substantially reducing shading costs and per-pixel storage compared to traditional deferred shading. AGAA uses the rasterization pipeline to generate a compact, pre-filtered geometric representation inside each pixel. We shade this representation at a fixed rate, independent of geometric complexity. By decoupling shading rate from geometric sampling rate, the algorithm reduces the storage and bandwidth costs of a geometry buffer, and allows scaling to high visibility sampling rates for anti-aliasing. AGAA with two aggregates per-pixel generates results comparable to 32<inline-formula><tex-math notation="LaTeX">$\times$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="crassin-ieq1-2586073.gif"/></alternatives></inline-formula> MSAA, but requires 54 percent less memory and is up to 2.6<inline-formula><tex-math notation="LaTeX">$\times$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="crassin-ieq2-2586073.gif"/></alternatives></inline-formula> faster (<inline-formula> <tex-math notation="LaTeX">$-30$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="crassin-ieq3-2586073.gif"/></alternatives></inline-formula> percent memory and 1.7 <inline-formula><tex-math notation="LaTeX">$\times$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="crassin-ieq4-2586073.gif"/></alternatives></inline-formula> faster for 8<inline-formula> <tex-math notation="LaTeX">$\times$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="crassin-ieq5-2586073.gif"/></alternatives></inline-formula> MSAA).

[1]  DupuyJonathan,et al.  Linear efficient antialiased displacement and reflectance mapping , 2013 .

[2]  Alexander Reshetov,et al.  Reducing aliasing artifacts through resampling , 2012, EGGH-HPG'12.

[3]  Brian Karis,et al.  Real Shading in Unreal Engine 4 by , 2013 .

[4]  Andrew Lauritzen,et al.  Variance shadow maps , 2006, I3D '06.

[5]  R. Ramamoorthi,et al.  Frequency domain normal map filtering , 2007, SIGGRAPH 2007.

[6]  Carsten Dachsbacher,et al.  The SGGX microflake distribution , 2015, ACM Trans. Graph..

[7]  Henry P. Moreton,et al.  Reducing shading on GPUs using quad-fragment merging , 2010 .

[8]  Tamy Boubekeur,et al.  Adaptive Supersampling for Deferred Anti-Aliasing , 2013 .

[9]  Carsten Dachsbacher,et al.  Decoupled deferred shading for hardware rasterization , 2012, I3D '12.

[10]  Philippe Decaudin,et al.  Rendering Forest Scenes in Real-Time , 2010 .

[11]  Hans-Peter Seidel,et al.  Spatio-temporal upsampling on the GPU , 2010, I3D '10.

[12]  Pierre Poulin,et al.  Linear efficient antialiased displacement and reflectance mapping , 2013, ACM Trans. Graph..

[13]  Elmar Eisemann,et al.  Interactive Indirect Illumination Using Voxel Cone Tracing , 2011, Comput. Graph. Forum.

[14]  Jung Hong Chuang Level of Detail for 3D Graphics , 2002 .

[15]  A. Fournier Filtering Normal Maps and Creating Multiple Surfaces , 1992 .

[16]  Marco Salvi,et al.  Streaming G-Buffer Compression for Multi-Sample Anti-Aliasing , 2014, High Performance Graphics.

[17]  Michael Toksvig Mipmapping Normal Maps , 2005, J. Graph. Tools.

[18]  Eric Enderton,et al.  Real-time stochastic rasterization on conventional GPU architectures , 2010, HPG '10.

[19]  Kiril Vidimce,et al.  Surface based anti-aliasing , 2012, I3D '12.

[20]  Sylvain Lefebvre,et al.  GigaVoxels: ray-guided streaming for efficient and detailed voxel rendering , 2009, I3D '09.

[21]  Marc Olano,et al.  LEAN mapping , 2010, I3D '10.

[22]  Dinesh Manocha,et al.  Appearance-preserving simplification , 1998, SIGGRAPH.

[23]  Alexander Reshetov Morphological antialiasing , 2009, High Performance Graphics.

[24]  Kurt Akeley,et al.  Reality Engine graphics , 1993, SIGGRAPH.

[25]  Jaakko Lehtinen,et al.  Decoupled sampling for graphics pipelines , 2011, TOGS.

[26]  Robert L. Cook,et al.  Stochastic simplification of aggregate detail , 2007, ACM Trans. Graph..

[27]  Robert Toth,et al.  A sort-based deferred shading architecture for decoupled sampling , 2013, ACM Trans. Graph..

[28]  Steve Marschner,et al.  Microfacet Models for Refraction through Rough Surfaces , 2007, Rendering Techniques.

[29]  Kartic Subr,et al.  Interactive rendering of acquired materials on dynamic geometry using bandwidth prediction , 2012, I3D '12.

[30]  Per H. Christensen,et al.  An Irradiance Atlas for Global Illumination in Complex Production Scenes , 2004, Rendering Techniques.

[31]  Frédo Durand,et al.  Billboard clouds for extreme model simplification , 2003, ACM Trans. Graph..

[32]  Tomas Akenine-Möller,et al.  Stochastic rasterization using time-continuous triangles , 2007, GH '07.

[33]  Morgan McGuire,et al.  Subpixel reconstruction antialiasing for deferred shading , 2011, I3D '11.

[34]  Marc Olano,et al.  Normal Distribution Mapping , 1997 .

[35]  Tomas Akenine-Möller,et al.  Efficient depth buffer compression , 2006, GH '06.

[36]  Dinesh Manocha,et al.  R-LODs: fast LOD-based ray tracing of massive models , 2006, SIGGRAPH '06.

[37]  Peter Shirley,et al.  Stochastic Billboard Clouds for Interactive Foliage Rendering , 2006, J. Graph. Tools.

[38]  Fabrice Neyret,et al.  Representing appearance and pre-filtering subpixel data in sparse voxel octrees , 2012, EGGH-HPG'12.

[39]  Fabrice Neyret,et al.  A Survey of Nonlinear Prefiltering Methods for Efficient and Accurate Surface Shading , 2012, IEEE Transactions on Visualization and Computer Graphics.