Importance-driven Stochastic Ray Radiosity
The stochastic ray radiosity method  is a radiosity method in which no form-factors are computed explicitly. Because of this, the method is very well-suited to compute the radiance distribution in very complex diffuse environments. In this paper we present an extension of this method which will provide a significant reduction of computational cost in cases where accurate knowledge of the illumination is needed in only a small part of the scene. This is accomplished by computing a second quantity, called importance, during the radiance computation. Importance is then used to modulate the patch sampling probabilities in order to obtain lower variance in relevant regions of the scene.
KeywordsComputer Graphic Total Importance Radiance Computation Virtual Screen Observer Position
Unable to display preview. Download preview PDF.
- 1.L. Aupperle and P. Hanrahan. Importance and discrete three-point transport. In 4th Eurographics Workshop on Rendering, Paris, France, pages 85–94,1993.Google Scholar
- 2.Ph. Bekaert and Y. D. Willems. An importance-driven rendering algorithm. In 10 th Spring School on Computer Graphics, Bratislava, Slovakia, pages 58–67, June 1994.Google Scholar
- 3.Ph. Bekaert and Y. D. Willems. Importance-driven progressive refinement radiosity. In 6th Eurographics Workshop on Rendering, Dublin, Ireland, pages 316–325, June 1995.Google Scholar
- 4.K. Bouatouch and S. Pattanaik. Interactive walk-through using particle tracing. In Computer Graphics International ’95, June 1995.Google Scholar
- 5.M. F. Cohen, S. E. Chen, J. R. Wallace, and D. P. Greenberg. A progressive refinement approach to fast radiosity image generation. In Computer Graphics (SIGGRAPH ’88 Proceedings), volume 22, pages 75–84, August 1988.Google Scholar
- 6.Ph. Dutré and Y. D. Willems. Potential-driven monte carlo particle tracing for diffuse environments with adaptive probability density functions. In 6th Eurographics Workshop on Rendering, Dublin, Ireland, pages 306–315, June 1995.Google Scholar
- 7.P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. In Computer Graphics (SIGGRAPH ’91 Proceedings), volume 25, pages 197–206, July 1991.Google Scholar
- 8.D. Lischinski, B. Smits, and D. P. Greenberg. Bounds and error estimates for radiosity. In Proceedings of SIGGRAPH ’94, pages 67–74, July 1994.Google Scholar
- 10.L. Neumann, W. Purgathofer, R. F. Tobler, A. Neumann, P. Eliás, M. Feda, and X. Pueyo. The stochastic ray method for radiosity. In 6th Eurographics Workshop on Rendering, Dublin, Ireland, pages 206–218, June 1995.Google Scholar
- 11.L. Neumann, R. F. Tobler, and P. Elias. The constant radiosity step. In 6th Eurographics Workshop on Rendering, Dublin, Ireland, pages 336–344, June 1995.Google Scholar
- 12.B. E. Smits, J. R. Arvo, and D. H. Salesin. An importance-driven radiosity algorithm. In Computer Graphics (SIGGRAPH ’92 Proceedings), volume 26, pages 273–282, July 1992.Google Scholar