{'fraction_non_alphanumeric': 0.008759124087591242, 'fraction_numerical': 0.0, 'mean_word_length': 5.411214953271028, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Testing Monte-Carlo Global Illumination Methods with Analytically Computable Scenes

The paper presents analytically computable scenes for testing global illumination algorithms with arbitary 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 approach a criterion is given that makes the radiance constant for an arbitary closed scene allowing either arbitary BRDFs or arbitary 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 arbitary lightsource models.