Importance-Driven Progressive Refinement Radiosity

  • Philippe Bekaert
  • Yves D. Willems
Part of the Eurographics book series (EUROGRAPH)


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.


Computer Graphic Global Illumination Individual View Viewing Parameter Primary Storage 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    S. E. Chen. Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system. Computer Graphics, 24 (4): 135–144, 1990.CrossRefGoogle Scholar
  3. 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. 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
  5. 5.
    P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics, 25 (4): 197–206, 1991.CrossRefGoogle Scholar
  6. 6.
    A. Kok. Grouping of patches in progressive radiosity. In Fourth Eurographics Workshop on Rendering, Paris, France, pages 221–232, June 1993.Google Scholar
  7. 7.
    S. Pattanaik and S. Mudur. The potential equation and importance in illumination computations. Computer Graphics Forum, 12: 131–136, 1993.CrossRefGoogle Scholar
  8. 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
  9. 9.
    F. X. Sillion, J. R. Arvo, S. H. Westin, and D. P. Greenberg. A global illumination solution for general reflectance distributions. Computer Graphics, 25 (4): 187–196, 1991.CrossRefGoogle Scholar
  10. 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
  11. 11.
    B. E. Smits, J. R. Arvo, and D. H. Salesin. An importance-driven radiosity algorithm. Computer Graphics, 26 (2): 273–282, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • Philippe Bekaert
    • 1
  • Yves D. Willems
    • 1
  1. 1.Department of Computer ScienceKatholieke Universiteit LeuvenLeuvenBelgium

Personalised recommendations