The Visual Computer

, Volume 12, Issue 2, pp 47–61 | Cite as

Global multipath Monte Carlo algorithms for radiosity

  • Mateu Sbert
  • Xavier Pueyo
  • Lázló Neumann
  • Werner Pergathofer
Original Articles


We present a new algorithm for radiosity, which is linear both in time and storage with the number of patches in a given scene; that is, the number of patches is increased by dividing each existing patch into smaller patches. The new algorithm is based on Integral Geometry and on the well-known algorithms for Monte Carlo particle transport. It considers the scene embedded in a field of lines, each representing the exchange between the pairs of points that result from the intersections of the line with the scene. For a given pair of points, this exchange is bidirectional. Lines are taken randomly. Both graphical and numerical results are given for the proposed algorithm, which is compared with a local Monte Carlo particle transport algorithm.


Image Processing Artificial Intelligence Computer Graphic Small Patch Particle Transport 
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. Buckalew C, Fussell D (1989) Illumination networks: fast realistic rendering with general reflectance functions. Comput Graph 23:89–98Google Scholar
  2. Drettakis G, Fiume E (1992) Concrete computation of global illumination using structured sampling. Proceedings of the 3rd Eurographics Workshop on rendering, Bristol, Elsevier, Amsterdam, pp 189–201Google Scholar
  3. Feda M, Purgathofer W (1993) Progressive ray refinement for Monte Carlo radiosity. Proceedings of the 4th Eurographics Workshop on Rendering, Paris, Elsevier, Amsterdam, pp 15–25Google Scholar
  4. Hammerley JM, Handscomb DC (1975) Monte Carlo methods. Methuen, LondonGoogle Scholar
  5. Kajiya JT (1986) The rendering equation. Comput Graph 20:143–150Google Scholar
  6. Neumann L (1995) Monte Carlo radiosity. Computing 55:23–42Google Scholar
  7. Pattanaik SN, Mudur SP (1992) Computation of global illumination by Monte Carlo simulation of the particle model of light. Proceedings of the 3rd Eurographics Workshop on rendering, Bristol, Elsevier, Amsterdam, pp 71–83Google Scholar
  8. Rubinstein RY (1981) Simulation and the Monte Carlo method. Wiley, New YorkGoogle Scholar
  9. Sbert M (1993) An integral geometry based method for fast formfactor computation. Comput Graph Forum 12:409–420Google Scholar
  10. Shirley P (1990) A ray tracing method for illumination calculation in diffuse-specular scenes. Graphics Interface '90, Toronto, Canadian Information Processing Society, Toronto, pp 205–211Google Scholar
  11. Siegel R, Howell JR (1992) Thermal radiative heat transfer. Hemisphere, Washington DCGoogle Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Mateu Sbert
    • 1
  • Xavier Pueyo
    • 1
  • Lázló Neumann
    • 2
  • Werner Pergathofer
    • 3
  1. 1.Department of Computer Science and Applied MathematicsUniversity of GironaGironaSpain
  2. 2.BudapestHungary
  3. 3.Institute of Computer GraphicsTechnical University of ViennaViennaAustria

Personalised recommendations