Precomputed radiance transfer: theory and practice

  • Authors:
  • Jan Kautz;Peter-Pike Sloan;Jaakko Lehtinen

  • Affiliations:
  • Massachusetts Institute of Technology;Microsoft Corporation;Helsinki University of Technology

  • Venue:
  • SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interactive rendering of realistic objects under general lighting models poses three principal challenges. Handling complex light transport phenomena like shadows, inter-reflections, caustics and sub-surface scattering is difficult to do in real time. Integrating these effects over large area light sources compounds the difficulty, and finally real objects have complex spatially-varying BRDF's. Precomputed Radiance Transfer (PRT) encapsulates a family of techniques that partially addresses these challenges. PRT is an active of area of research that has relevance to both the academic research community and practitioners of interactive computer graphics. This technique and its variants are being actively investigated in the game development community and there is quite a lot of interest due to the recent appearance of PRT techniques in games such as "Halo 2".This course covers these techniques, compares them and discusses their various strengths and weaknesses. A more rigorous derivation directly from the rendering equation is presented along with practical implementation details, both of which are generally not included in technical papers. After introducing the necessary foundation (rendering equation, basis functions, etc.), we begin with simple PRT for diffuse objects. We continue with general PRT using the concept of transfer matrices, which allow for arbitrary reflectance models. The possible choices for basis functions are discussed as well. Different light source representations are presented and compared. Finally, we discuss practical issues with PRT, such as data compression, spatial sampling, normal mapping, precomputation, and more. By the end of the course the audience will be able to pick the right algorithm for their needs and will hopefully have gained some of the unpublished insights the speakers have gained by working in this area.