The Multi-Frame Lighting Method: A Monte Carlo Based Solution for Radiosity in Dynamic Environments
In this paper we present a method for radiosity computation in dynamic scenes. The algorithm is intended for animations in which the motion of the objects is known in advance. Radiosity is computed using a Monte Carlo approach. Instead of computing each frame separately, we propose to compute the lighting simulation of a sequence of frames in a unique process. This is achieved by the merging of the whole sequence of frames into a single scene, so each moving object is replicated as many times as frames.
We present results which show the performance of the proposed method. This is specially interesting for sequences of a significant number of frames. We also present an analysis of the algorithm complexity. An important feature of the algorithm is that the accuracy of the image in each frame is the same as the one we would obtain by means of computing each frame separately.
KeywordsForm Factor Dynamic Object Global Illumination Lighting Simulation Progressive Refinement
Unable to display preview. Download preview PDF.
- 2.C. Buckalew and D. Fussell. Illumination Networks: Fast Realistic Rendering with General Reflectance Functions. Proc. ACM SIGGRAPH ’89, 23(3):89–98.Google Scholar
- 3.S.E. Chen. Incremental Radiosity: An extension of Progressive Radiosity to an Interactive Image Synthesis System. Proc. ACM SIGGRAPH ’90 135–144.Google Scholar
- 4.M. Cohen, S. Chen, J. Wallace and D. Greenberg. A Progressive Refinement Approach to Fast Radiosity Image Generation. Proc. ACM SIGGRAPH ’88 22(4):75–84.Google Scholar
- 6.D. Forsyth, C. Yang and K. Teo. Efficient radiosity in dynamic environments. Proceedings of the Fifth Eurographics Workshop on Rendering Darmstadt, June 1994.Google Scholar
- 8.P. Hanrahan, D. Saltzman and L. Aupperle. A Rapid Hierarchical Radiosity Algorithm. Proc. ACM SIGGRAPH ’91, 25(4):197–206.Google Scholar
- 9.L. Neumann. Monte Carlo Radiosity. Computing, 55:23–42.Google Scholar
- 10.J. Nimeroff, J. Dorsey and H. Rushmeier. A Framework for Global Illumination in Animated Environments. Rendering Techniques 95 Springer Wien New York, pp. 92–103, 1995.Google Scholar
- 11.D. George, F. Sillion and D. Greenberg. A Radiosity Redistribution Algorithm for Dynamic Environments, IEEE Computer Graphics and Applications, 10(4), 1990.Google Scholar
- 12.S. Pattanaik and S. Mudur. Computation of Global Illumination by Monte Carlo Simulation of Particle Model of Light. Proceedings of the III Eurographics Workshop on Rendering, pp. 71–83, Bristol, May 1992.Google Scholar
- 13.M. Sbert. An Integral Geometry Based Method for Fast Form Factor Computation. Proceedings of Eurographics 93, pp. 409–420.Google Scholar
- 14.M. Sbert, F. Perez and X. Pueyo. Global Monte Carlo. A Progressive Solution. Rendering Techniques 95 Springer Wien New York, pp. 231–239, 1995.Google Scholar
- 15.M. Sbert, X. Pueyo, L. Neumann and W. Purgathofer. Global Multi-Path Monte Carlo Algorithms for Radiosity. The Visual Computer, 12(2), pp.47–57, 1996.Google Scholar
- 16.P. Shirley. Radiosity via Ray-tracing. Graphics Gems II pp. 306–310. Academic Press, San Diego, 1991.Google Scholar
- 17.F. Sillion and C. Puech. Radiosity and Global Illumination. Morgan Kaufmann Publishers, California, 1994.Google Scholar