{'fraction_non_alphanumeric': 0.01456953642384106, 'fraction_numerical': 0.0, 'mean_word_length': 5.461538461538462, '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}}
Quasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem

The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex and discontinuous. Due to this complexity Monte Carlo methods are an interesting tool for estimating a solution. In this article we investigate the application of deterministic quasi-Monte Carlo methods, as compared to pure Monte Carlo methods, for global illumination calculations in very complex environments and give numerical evidence for the superiority of the quasi-Monte Carlo methods.