Combining global and local global-illumination algorithms

Authors:
György Antal;Roel Martinez;Ferenc Csonka;Mateu Sbert;László Szirmay-Kalos
Affiliations:
Budapest University of Technology;University of Girona;Budapest University of Technology;University of Girona;Budapest University of Technology
Venue:
SCCG '03 Proceedings of the 19th spring conference on Computer graphics
Year:
2003

Citing 3
Cited 0

The hemi-cube: a radiosity solution for complex environments

SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Hemicube shooting for non-diffuse global illumination

SCCG '02 Proceedings of the 18th spring conference on Computer graphics
Robust monte carlo methods for light transport simulation

Robust monte carlo methods for light transport simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global illumination algorithms can be classified as local and global transfer methods. Local methods find a single point (or patch) in a given step and transfer its radiance towards other point(s). Global methods, on the other hand, select the source and the target of the transfer simultaneously. Local methods are better if the radiance distribution is heterogeneous and the scene is sparse, while global methods can win for dense scenes of homogeneous radiance. This paper proposes the combination of global and local global illumination algorithms in the sense of multiple importance sampling. In this way, the combined method can eliminate the higher noise at the corners produced by local methods and the need for first-shot for global techniques.