Analyzing Deferred Rendering Techniques

In this article various deferred rendering algorithms are investigated and a classification that formalizes the comparison between these popular rendering techniques is introduced. This classification consists of measuring functions that can be used to determine the expected algorithm performance in various situations. Multiple analysis spaces are defined that better express the strengths and weaknesses of each algorithm. Given the abundance of deferred rendering methods and the performance tradeoffs implied by different hardware targets, rendered objects complexity and light setup complexity, our framework makes choosing or modifying an algorithm out of this collection a simpler process. The following spaces are used for algorithm examination and comparison: GPU commands, processing cost, allocated memory and expected bandwidth consumption. Furthermore, the analysis spaces are independent of the illumination model and are suitable for a decoupled examination, in which each stage of rendering process is usually executed at a different sampling rate.

[1]  Ulf Assarsson,et al.  Clustered deferred and forward shading , 2012, EGGH-HPG'12.

[2]  Ulf Assarsson,et al.  Tiled Shading , 2011, J. Graphics, GPU, & Game Tools.

[3]  Robert L. Cook,et al.  The Reyes image rendering architecture , 1987, SIGGRAPH.

[4]  Takahiro Harada,et al.  A 2.5D culling for Forward+ , 2012, SIGGRAPH Asia Technical Briefs.

[5]  Scott Kircher,et al.  Inferred lighting: fast dynamic lighting and shadows for opaque and translucent objects , 2009, SIGGRAPH 2009.

[6]  Matt Pharr,et al.  Gpu gems 2: programming techniques for high-performance graphics and general-purpose computation , 2005 .

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

[8]  Morgan McGuire,et al.  Filtering approaches for real-time anti-aliasing , 2011, SIGGRAPH '11.

[9]  Neil Hunt,et al.  The triangle processor and normal vector shader: a VLSI system for high performance graphics , 1988, SIGGRAPH.

[10]  Carsten Dachsbacher,et al.  Reflective shadow maps , 2005, I3D '05.

[11]  Shinji Ogaki,et al.  Real-time bidirectional path tracing via rasterization , 2012, I3D '12.

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

[13]  Hans-Peter Seidel,et al.  Approximating dynamic global illumination in image space , 2009, I3D '09.

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

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

[16]  Ulf Assarsson,et al.  Implementing efficient virtual shadow maps for many lights , 2014, SIGGRAPH '14.

[17]  Warren A. Hunt,et al.  The Visibility Buffer: A Cache-Friendly Approach to Deferred Shading , 2013 .

[18]  Morgan McGuire,et al.  Lighting Deep G-Bu↵ers: Single-Pass, Layered Depth Images with Minimum Separation Applied to Indirect Illumination , 2013 .