Adaptive numerical cumulative distribution functions for efficient importance sampling

As image-based surface reflectance and illumination gain wider use in physically-based rendering systems, it is becoming more critical to provide representations that allow sampling light paths according to the distribution of energy in these high-dimensional measured functions. In this paper, we apply algorithms traditionally used for curve approximation to reduce the size of a multidimensional tabulated Cumulative Distribution Function (CDF) by one to three orders of magnitude without compromising its fidelity. These adaptive representations enable new algorithms for sampling environment maps according to the local orientation of the surface and for multiple importance sampling of image-based lighting and measured BRDFs.

[1]  Leonidas J. Guibas,et al.  Optimally combining sampling techniques for Monte Carlo rendering , 1995, SIGGRAPH.

[2]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

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

[4]  Michael T. Goodrich.  Efficient piecewise-linear function approximation using the uniform metric: (preliminary version) , 1994, SCG '94.

[5]  Paul Lalonde,et al.  Generating Reflected Directions from BRDF Data , 1997, Comput. Graph. Forum.

[6]  Wojciech Matusik,et al.  A data-driven reflectance model , 2003, ACM Trans. Graph..

[7]  Mathias Paulin,et al.  BRDF Measurement Modelling using Wavelets for Efficient Path Tracing , 2003, Comput. Graph. Forum.

[8]  Alexander Keller,et al.  Efficient Illumination by High Dynamic Range Images , 2003, Rendering Techniques.

[9]  Paul Lalonde,et al.  Generating Reflected Directions from BRDF Data , 1997 .

[10]  James Arvo,et al.  Stratified sampling of spherical triangles , 1995, SIGGRAPH.

[11]  V. Ostromoukhov,et al.  Fast hierarchical importance sampling with blue noise properties , 2004, SIGGRAPH 2004.

[12]  W. S. Chan,et al.  Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error , 1996, Int. J. Comput. Geom. Appl..

[13]  Greg Humphreys,et al.  Physically Based Rendering: From Theory to Implementation , 2004 .

[14]  J. Arvo.  Stratified Sampling of 2-Manifolds , 2001 .

[15]  R. Larsen,et al.  Introduction to Probability and Its Applications , 1985 .

[16]  Paul E. Debevec,et al.  Rendering synthetic objects into real scenes: bridging traditional and image-based graphics with global illumination and high dynamic range photography , 1998, SIGGRAPH '08.

[17]  Ovidiu Daescu,et al.  Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space , 2003, Int. J. Comput. Geom. Appl..

[18]  Paul L. Rosin.  Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Serge J. Belongie,et al.  Structured importance sampling of environment maps , 2003, ACM Trans. Graph..

[20]  Szymon Rusinkiewicz,et al.  Efficient BRDF importance sampling using a factored representation , 2004, SIGGRAPH 2004.

[21]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .