The Community for Technology Leaders
Green Image
Issue No. 03 - May/June (2003 vol. 23)
ISSN: 0272-1716
pp: 28-37
Katja Daubert , Max-Planck-Institute f?r Informatik, Germany
Jan Kautz , Max-Planck-Institute f?r Informatik, Germany
Hans-Peter Seidel , Max-Planck-Institute f?r Informatik, Germany
Wolfgang Heidrich , University of British Columbia
Jean-Michel Dischler , University Louis Pasteur, Strasbourg
<p>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.</p><p>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.</p><p>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. </p>
Illumination, Ray Tracing, Monte Carlo Techniques, Frame Buffer Algorithms, Texture Mapping, Reflectance and Shading Models, Volume Rendering

J. Dischler, H. Seidel, W. Heidrich, K. Daubert and J. Kautz, "Efficient Light Transport Using Precomputed Visibility," in IEEE Computer Graphics and Applications, vol. 23, no. , pp. 28-37, 2003.
81 ms
(Ver 3.3 (11022016))