Quasi-Monte Carlo Methods in Computer Graphics, Part II

  • The radiance equation, which describes the global illumination problem in computer graphics, is a high dimensional integral equation. Estimates of the solution are usually computed on the basis of Monte Carlo methods. In this paper we propose and investigate quasi-Monte Carlo methods, which means that we replace (pseudo-) random samples by low discrepancy sequences, yielding deterministic algorithms. We carry out a comparative numerical study between Monte Carlo and quasi-Monte Carlo methods. Our results show that quasi-Monte Carlo converges considerably faster.

Export metadata

Additional Services

Search Google Scholar
Author:Stefan Heinrich, Alexander Keller
Series (Serial Number):Interner Bericht des Fachbereich Informatik (243)
Document Type:Report
Language of publication:English
Date of Publication (online):2017/10/25
Year of first Publication:1994
Publishing Institution:Technische Universit├Ąt Kaiserslautern
Date of the Publication (Server):2017/10/25
Page Number:12
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)