• search hit 1 of 20
Back to Result List

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

  • 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.
Author:Alexander Keller
URN (permanent link):urn:nbn:de:hbz:386-kluedo-49598
Serie (Series number):Interner Bericht des Fachbereich Informatik (260)
Document Type:Report
Language of publication:English
Publication Date:2017/10/26
Year of Publication:1994
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/26
Number of page:14
Faculties / Organisational entities: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)