Importance-Driven Progressive Refinement Radiosity
A simple way of using importance, also called visual potential, in progressive refinement radiosity and similar radiosity methods is presented. This is accomplished by taking the visual potential of the patches into account when choosing of the “next most contributing” patch. Quite faster convergence is obtained for individual views in which only a relatively small part of a scene is visible. We also show how changes of the viewing parameters can be handled efficiently by computing importance incrementally.
KeywordsComputer Graphic Global Illumination Individual View Viewing Parameter Primary Storage
Unable to display preview. Download preview PDF.
- 1.Ph. Bekaert and Y. D. Willems. A progressive importance-driven rendering algorithm. In Proceedings of the X. Spring School on Computer Graphics, Bratislava, Slovakia, pages 58 - 67, June 1994.Google Scholar
- 3.M. F. Cohen, S. E.Chen, J. R. Wallace, and D. P. Greenberg. A progressive refinement approach to fast radiosity image generation. Computer Graphics, 22 (4): 75–84, 1988.Google Scholar
- 4.G. Greiner, W. Heidrich, and Ph. Slusallek. Bockwiserefinement — a new method for solving the radiosity problem. In Proceedings of the fourth Eurographics Workshop on Rendering, Paris, France, pages 233–245, 1993.Google Scholar
- 6.A. Kok. Grouping of patches in progressive radiosity. In Fourth Eurographics Workshop on Rendering, Paris, France, pages 221–232, June 1993.Google Scholar
- 8.F. Sillion. Clustering and volume scattering for hierarchical radiosity calculations. In Proceedings of the fifth Eurographics Workshop on Rendering, Darmstadt, Germany, pages 105–115, 1994.Google Scholar
- 10.B. Smits, J. Arvo, and D. Greenberg. A clustering algorithm for radiosity in complex environments. In Computer Graphics (SIGGRAPH ’94 Proceedings), pages 435–443, July 1994.Google Scholar