• search hit 13 of 25
Back to Result List

On the Efficiency of Multiple Importance Sampling

  • Approximating illumination by point light sources, as done in many professional applications, suffers from the problem of the weak singularity: Numerical exceptions caused by the division by the squared distance between the point light source and the point to be illuminated must be avoided. Multiple importance sampling overcomes these problems by combining multiple sampling techniques by weights. Such a set of weights is called a heuristic. So far the estimators resulting from a heuristic only have been analyzed for variance. Since the cost of sampling is not at all constant for different sampling techniques, it is possible to find more efficient heuristics, even though they may hove higher variance. Based on our new stratification heuristic, we present a robust and unbiased global illumination algorithm. By numerical examples, we show that it is more efficient than previous heuristics. The algorithm is as simple as a path tracer, but elegantly avoids the problem of the weak singularity.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:T. Kollig, A. Keller
URN (permanent link):urn:nbn:de:hbz:386-kluedo-49794
Serie (Series number):Interner Bericht des Fachbereich Informatik (328)
Document Type:Report
Language of publication:English
Publication Date:2017/10/27
Year of Publication:2004
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/27
Number of page:8
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)