Bidirectional Radiosity

  • Ph. Dutré
  • Ph. Bekaert
  • F. Suykens
  • Y. D. Willems
Conference paper
Part of the Eurographics book series (EUROGRAPH)


In this paper we present a new algorithm for solving the global illumination problem, based on the mathematical framework resulting from the dual set of equations that describe light transport in a three-dimensional environment. The proposed method is a finite element algorithm and propagates radiance as well as potential, thereby focusing on the rapid and efficient computation of the flux emitted by selected patches. We will show that the method takes into account all possible light paths, and that a faster solution can be obtained compared to other radiosity algorithms.


Computer Graphic Global Illumination Single Patch Light Transport Potential Path 
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. “Importance-driven progressive refinement radiosity.” In Rendering Techniques ‘85, (P. Hanrahan, W. Purgathofer eds.), pages 316–325, Springer, 1995.Google Scholar
  2. [2]
    Michael F. Cohen, Shenchang Eric Chen, John R. Wallace, and Donald P. Greenberg. “A progressive refinement approach to fast radiosity image generation.”, Computer Graphics (SIGGRAPH ‘88 Proceedings), volume 22, pages 75–84.Google Scholar
  3. [3]
    Michael F. Cohen and John R. Wallace. “Radiosity and realistic image synthesis.” Academic Press Professional, San Diego, CA, 1993.Google Scholar
  4. [4]
    Robert L. Cook, Thomas Porter, and Loren Carpenter. “Distributed ray tracing.”, Computer Graphics (SIGGRAPH ‘84 Proceedings), volume 18, pages 137–145.Google Scholar
  5. [5]
    Ph. Dutré and Y.D. Willems. “Importance-driven light tracing.” In Photo realistic Rendering Techniques, (G. Sakas, P. Shirley, S. Muller eds.), pages 188–197, Springer, 1995.Google Scholar
  6. [6]
    Ph. Dutré. Mathematical Frameworks and Monte Carlo algorithms for Global Illumination in Computer Graphics. PhD. Thesis, Katholieke Universiteit Leuven, September 1996.Google Scholar
  7. [7]
    A. Glassner. Principles of Digital Image Synthesis. Morgan Kaufmann, 1995.Google Scholar
  8. [8]
    P. Hanrahan, D. Salzman, L. Aupperle. “A Rapid Hierarchical Radiosity Algorithm.”, Computer Graphics (SIGGRAPH ‘81 Proceedings), volume 25, pages 197–206.Google Scholar
  9. [9]
    Henrik Wann Jensen. “Global illumination using photon maps.” In Rendering Techniques ‘96, (X. Pueyo, P. Schröder eds.), pages 21–30, Springer, 1996.Google Scholar
  10. [10]
    James T. Kajiya. “The rendering equation.”, Computer Graphics (SIGGRAPH ‘86 Proceedings), volume 20, pages 143–150.Google Scholar
  11. [11]
    E.P. Lafortune and Y.D. Willems. “Bi-directional path tracing.” In Proceedings of CompuGraphics, pages 145–153, Alvor, Portugal, December 1993.Google Scholar
  12. [12]
    Brian E. Smits, James R. Arvo, and David H. Salesin. “An importance-driven radiosity algorithm.”, Computer Graphics (SIGGRAPH ‘82 Proceedings), volume 26, pages 273–282.Google Scholar
  13. [13]
    S. N. Pattanaik and S. P. Mudur. “The potential equation and importance in illumination computations.” Computer Graphics Forum, 12 (2): 131–136, 1993.CrossRefGoogle Scholar
  14. [14]
    Francois Sillion and Claude Puech. Radiosity and Global Illumination. Morgan Kaufmann, San Francisco, 1994.Google Scholar

Copyright information

© Springer-Verlag/Wien 1997

Authors and Affiliations

  • Ph. Dutré
    • 1
  • Ph. Bekaert
    • 1
  • F. Suykens
    • 1
  • Y. D. Willems
    • 1
  1. 1.Department of Computer ScienceKatholieke Universiteit LeuvenHeverleeBelgium

Personalised recommendations