Computer Graphics Forum
Volume22, Issue 1 (March 2003)
Authors:
Cyrille Damez
Max-Planck-Institut für Informatik, Germany
Kirill Dmitriev
Max-Planck-Institut für Informatik, Germany
Karol Myszkowski
Max-Planck-Institut für Informatik, Germany
Summary:
Global illumination algorithms are regarded as computationally intensive. This cost is a practical problem when producing animations or when interactions with complex models are required. Several algorithms have been proposed to address this issue. Roughly, two families of methods can be distinguished. The first one aims at providing interactive feedback for lighting design applications. The second one gives higher priority to the quality of results, and therefore relies on offline computations. Recently, impressive advances have been made in both categories. In this report, we present a survey and classification of the most up-to-date of these methods.