TY - RPRT
A1 - Keller, Alexander
T1 - A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting
N2 - The main problem 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.
T3 - Interner Bericht des Fachbereich Informatik - 260
Y1 - 1994
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4959
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-49598
ER -