Efficient Light Transport Using Precomputed Visibility

  • Authors:
  • Katja Daubert;Jan Kautz;Hans-Peter Seidel;Wolfgang Heidrich;Jean-Michel Dischler

  • Affiliations:
  • Max-Planck-Institute für Informatik, Germany;Max-Planck-Institute für Informatik, Germany;Max-Planck-Institute für Informatik, Germany;University of British Columbia;University Louis Pasteur, Strasbourg

  • Venue:
  • IEEE Computer Graphics and Applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Visibility computations are the most time-consuming part of global illumination algorithms. The cost is amplified by the fact that identical or similar information is often recomputed multiple times. In particular, this is the case when multiple images of the same scene need to be generated under varying lighting conditions and/or viewpoints.This article describes a general method of precomputing, storing, and reusing visibility information for light transport in a number of different types of scenes. In particular, it considers general parametric surfaces, triangle meshes without a global parameterization, and participating media. It also reorders the light transport in such a way that the visibility information is accessed in structured memory access patterns.This yields a method well suited for SIMD-style parallelization of the light transport, and can efficiently be implemented both in software and graphics hardware.