Skip to main content
Log in

Global multipath Monte Carlo algorithms for radiosity

  • Original Articles
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Buckalew C, Fussell D (1989) Illumination networks: fast realistic rendering with general reflectance functions. Comput Graph 23:89–98

    Google Scholar 

  • 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–201

    Google Scholar 

  • 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–25

    Google Scholar 

  • Hammerley JM, Handscomb DC (1975) Monte Carlo methods. Methuen, London

    Google Scholar 

  • Kajiya JT (1986) The rendering equation. Comput Graph 20:143–150

    Google Scholar 

  • Neumann L (1995) Monte Carlo radiosity. Computing 55:23–42

    Google Scholar 

  • 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–83

    Google Scholar 

  • Rubinstein RY (1981) Simulation and the Monte Carlo method. Wiley, New York

    Google Scholar 

  • Sbert M (1993) An integral geometry based method for fast formfactor computation. Comput Graph Forum 12:409–420

    Google Scholar 

  • 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–211

  • Siegel R, Howell JR (1992) Thermal radiative heat transfer. Hemisphere, Washington DC

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mateu Sbert.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sbert, M., Pueyo, X., Neumann, L. et al. Global multipath Monte Carlo algorithms for radiosity. The Visual Computer 12, 47–61 (1996). https://doi.org/10.1007/BF01782104

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01782104

Keywords

Navigation