The Community for Technology Leaders
RSS Icon
Issue No.03 - May/June (2003 vol.23)
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
Katja Daubert, Jan Kautz, Hans-Peter Seidel, Wolfgang Heidrich, Jean-Michel Dischler, "Efficient Light Transport Using Precomputed Visibility", IEEE Computer Graphics and Applications, vol.23, no. 3, pp. 28-37, May/June 2003, doi:10.1109/MCG.2003.1198260
1. W. Heidrich et al., "Illuminating Micro Geometry Based on Precomputed Visibility," Computer Graphics (Proc. Siggraph 2000), ACM Press, 2000, pp. 455-464.
2. I. Sobol, "The Use ofω2-Distribution for Error Estimation in the Calculation of Integrals by the Monte Carlo Method," U.S.S.R. Computational Mathematics and Mathematical Physics, 1962, pp. 717-723.
3. N. Max, "Horizon Mapping: Shadows for Bump-Mapped Surfaces," The Visual Computer, vol. 4, no. 2, July 1988, pp. 109-117.
4. F. Durand, G. Drettakis, and C. Puech, “The Visibility Skeleton: A Powerful and Efficient Multi-Purpose Global Visibility Tool,” Proc. ACM SIGGRAPH, pp. 89-100, 1997.
5. A.W.F. Lee, W. Sweldens, P. Schröder, L. Cowsar, and D. Dobkin, “MAPS: Multiresolution Adaptive Parameterization of Surfaces,” Computer Graphics (SIGGRAPH '98 Proc.), M. Cohen, ed., vol. 32, pp. 95-104, July 1998.
6. B. Cabral, N. Cam, and J. Foran, “Accelerated Volume Rendering and Tomographic Reconstruction Using Texture Mapping Hardware,” Proc. 1994 Symp. Volume Visualization, pp. 91-98, 1994.
7. D.S. Ebert and R.E. Parent, “Rendering and Animation of Gaseous Phenomena by Combining Fast Volume and Scanline A-Buffer Techniques,” Computer Graphics (SIGGRAPH '90 Proc.), F. Baskett, ed., vol. 24, no. 4, pp. 357-366, Aug. 1990.
8. J.T. Kajiya and B.P. Von Herzen, "Ray Tracing Volume Densities," Proc. Computer Graphics (SIGGRAPH '84), vol. 18, no. 3, pp. 165-174, July 1984.
9. S.H. Westin, J.R. Arvo, and K.E. Torrance, “Predicting Reflectance Functions from Complex Surfaces,” Computer Graphics, vol. 26, no. 2, pp. 255-264, 1992.
10. E. Lafortune et al., "Non-Linear Approximation of Reflectance Functions," Computer Graphics (Proc. Siggraph 97), ACM Press, 1997, pp. 117-126.
11. J. Kautz and M. McCool, "Interactive Rendering with Arbitrary BRDFs Using Separable Approximations," Rendering Techniques 99 (Proc. Eurographics Workshop on Rendering), Eurographics, 1999, pp. 247-260.
12. K.J. Dana, B. van Ginneken, S.K. Nayar, and J.J. Koenderink, “Reflectance and Texture of Real-World Surfaces,” ACM Trans. Graphics, vol. 18, no. 1, pp. 1-34, Jan. 1999.
13. K. Daubert et al., "Efficient Cloth Modeling and Rendering," Rendering Techniques, S. Gortler and K. Myszkowski, eds., Springer, 2001, pp. 63-70.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool