Skip to main content
SpringerLink
Log in

A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting

  • Conference paper
Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing

Part of the book series: Lecture Notes in Statistics ((LNS,volume 106))

Abstract

One of the main problems in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all physical effects of light, must be considered. Due to this complexity Monte Carlo methods seem to be an appropriate approach to solve the REQ approximately. We show that replacing Monte Carlo by quasi-Monte Carlo in some steps of the algorithm results in a faster convergence

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Cohen, J.Wallace: Radiosity and Realistic Image Synthesis, Academic Press Professional, Cambridge 1993.

    MATH  Google Scholar 

  2. J.H.Halton, G.Weller: Algorithm 247: Radical-inverse quasi-random point sequence [G5], Comm. ACM, No.12, 7(1964), pp. 701 – 702.

    Article  Google Scholar 

  3. S.Heinrich, A.Keller: Quasi-Monte Carlo methods in computer graphics, Part I: The QMC-Buffer, Technical Report 242/94, University of Kaiserslautern, 1994.

    Google Scholar 

  4. S.Heinrich, A.Keller: Quasi-Monte Carlo methods in computer graphics, Part II: The Radiance Equation, Technical Report 243/94, University of Kaiserslautern, 1994.

    Google Scholar 

  5. E.Hlawka: Lösung von Integralgleichungen mittels zahlentheoretischer Me- thoden I, Sitzungsber., Abt. II, Österr. Akad. Wiss., Math.-Naturwiss. Kl., 171(1962), pp. 103 – 123.

    MathSciNet  MATH  Google Scholar 

  6. S.P.Mudur, S.N.Pattanaik: Monte Carlo methods for computer graphics, in State of the Art Reports, Eurographics, 1993.

    Google Scholar 

  7. H.Neunzert, J.Wick: Die Theorie der asymptotischen Verteilung und die nu- merische Lösung von Integrodifferentialgleichungen, Numer. Math., 21(1973), pp. 234 – 243.

    Article  MathSciNet  MATH  Google Scholar 

  8. H.Niederreiter: Random Number Generation and Quasi-Monte Carlo Methods, SIAM Philadelphia, Pennsylvania 1992.

    MATH  Google Scholar 

  9. H.Niederreiter: New Methods for Pseudorandom Number and Pseudorandom Vector Generation, Proc. 1992 Winter Simulation Conference (Arlington, VA, 1992), IEEE Press, Piscataway, NJ, 1992, pp. 264 – 269.

    Google Scholar 

  10. S.Paskov: Termination Criteria for Linear Problems, Technical Report, to appear, Columbia University, 1994.

    Google Scholar 

  11. P.K.Sarkar, M.A.Prasad: A comparative study of pseudo and quasi random sequences for the solution of integral equations, J. Comp. Physics, 68(1987), pp. 66 – 88.

    Article  MathSciNet  MATH  Google Scholar 

  12. J.Struckmeier: Fast generation of low-discrepancy sequences, Berichte der Ar- beitsgruppe Technomathematik, Nr.93, Fachbereich Mathematik, Universität Kaiserslautern.

    Google Scholar 

  13. G.Ward: Measuring and Modeling Anisotropic Reflection, Computer Graphics, No.2, 26(1992), pp. 265 – 272.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik AG Numerische Algorithmen, Universität Kaiserslautern, Postfach 3049, D-67653, Kaiserslautern, Germany

    Alexander Keller

Authors
  1. Alexander Keller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institüt für Informationsverabeitung, Osterreichische Akademie der Wissenschaften, Sonnenfelsgasse 19/2, A-1010, Wien, Austria

    Harald Niederreiter

  2. Department of Mathematical Sciences, University of Nevada, Las Vegas, 89154, Las Vegas, Nevada, USA

    Peter Jau-Shyong Shiue

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Keller, A. (1995). A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting. In: Niederreiter, H., Shiue, P.JS. (eds) Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2552-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2552-2_15

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-94577-4

  • Online ISBN: 978-1-4612-2552-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation