Testing Monte-Carlo Global Illumination Methods with Analytically Computable Scenes

Abstract

The paper presents analytically computable scenes for testing global illumination algo-rithms with arbitrary BRDFs. The task of these scenes is to enable us to compare global illumination algorithms and check the correctness of the implementation. In our first ap-proach a criterion is given that makes the radiance constant for an arbitrary closed scene allowing either arbitrary BRDFs or arbitrary lightsource models. In the second approach the geometry is assumed to be an internal surface of a sphere. Here homogeneous diffuse and mirror like reflections can be tested with arbitrary lightsource models.