Rich‐VPLs for Improving the Versatility of Many‐Light Methods

Many‐light methods approximate the light transport in a scene by computing the direct illumination from many virtual point light sources (VPLs), and render low‐noise images covering a wide range of performance and quality goals. However, they are very inefficient at representing glossy light transport. This is because a VPL on a glossy surface illuminates a small fraction of the scene only, and a tremendous number of VPLs might be necessary to render acceptable images. In this paper, we introduce Rich‐VPLs which, in contrast to standard VPLs, represent a multitude of light paths and thus have a more widespread emission profile on glossy surfaces and in scenes with multiple primary light sources. By this, a single Rich‐VPL contributes to larger portions of a scene with negligible additional shading cost. Our second contribution is a placement strategy for (Rich‐)VPLs proportional to sensor importance times radiance. Although both Rich‐VPLs and improved placement can be used individually, they complement each other ideally and share interim computation. Furthermore, both complement existing many‐light methods, e.g. Lightcuts or the Virtual Spherical Lights method, and can improve their efficiency as well as their application for scenes with glossy materials and many primary light sources.

[1]  K. Bala,et al.  Lightcuts: a scalable approach to illumination , 2005, SIGGRAPH 2005.

[2]  Leonidas J. Guibas,et al.  Robust Monte Carlo methods for light transport simulation , 1997 .

[3]  Philipp Slusallek,et al.  Combining global and local virtual lights for detailed glossy illumination , 2010, ACM Trans. Graph..

[4]  Leonidas J. Guibas,et al.  Metropolis light transport , 1997, SIGGRAPH.

[5]  Greg Turk,et al.  Generating textures on arbitrary surfaces using reaction-diffusion , 1991, SIGGRAPH.

[6]  Ben Spencer,et al.  Into the Blue: Better Caustics through Photon Relaxation , 2009, Comput. Graph. Forum.

[7]  K. Bala,et al.  Effects of global illumination approximations on material appearance , 2010, SIGGRAPH 2010.

[8]  Alexander Keller,et al.  Instant radiosity , 1997, SIGGRAPH.

[9]  Philipp Slusallek,et al.  Importance Caching for Complex Illumination , 2012, Comput. Graph. Forum.

[10]  Ingmar Peter,et al.  Importance Driven Construction of Photon Maps , 1998, Rendering Techniques.

[11]  Fabio Pellacini,et al.  LightSlice: matrix slice sampling for the many-lights problem , 2011, ACM Trans. Graph..

[12]  Adam Arbree,et al.  Scalable Realistic Rendering with Many‐Light Methods , 2014, Eurographics.

[13]  Henrik Wann Jensen,et al.  Global Illumination using Photon Maps , 1996, Rendering Techniques.

[14]  Carsten Dachsbacher,et al.  Screen-space bias compensation for interactive high-quality global illumination with virtual point lights , 2011, SI3D.

[15]  K. Bala,et al.  Matrix row-column sampling for the many-light problem , 2007, ACM Trans. Graph..

[16]  K. Bala,et al.  Multidimensional lightcuts , 2006, SIGGRAPH 2006.

[17]  Miloš Hašan,et al.  Virtual spherical lights for many-light rendering of glossy scenes , 2009, SIGGRAPH 2009.

[18]  Philipp Slusallek,et al.  Simple and Robust Iterative Importance Sampling of Virtual Point Lights , 2010, Eurographics.

[19]  Pramook Khungurn,et al.  Bidirectional lightcuts , 2012, ACM Trans. Graph..

[20]  Bernard Péroche,et al.  Metropolis Instant Radiosity , 2007, Comput. Graph. Forum.

[21]  Bernard Péroche,et al.  Bidirectional instant radiosity , 2006, EGSR '06.

[22]  T. Kollig,et al.  Illumination in the Presence of Weak Singularities , 2006 .

[23]  James T. Kajiya,et al.  The rendering equation , 1986, SIGGRAPH.

[24]  Anton Kaplanyan,et al.  Path Space Regularization for Holistic and Robust Light Transport , 2013, Comput. Graph. Forum.

[25]  Carsten Dachsbacher,et al.  Octahedron Environment Maps , 2008, VMV.