dc.contributor.author | Bekaert, Philippe | en_US |
dc.contributor.author | Sbert, Mateu | en_US |
dc.contributor.author | Halton, John | en_US |
dc.contributor.editor | P. Debevec and S. Gibson | en_US |
dc.date.accessioned | 2014-01-27T14:06:10Z | |
dc.date.available | 2014-01-27T14:06:10Z | |
dc.date.issued | 2002 | en_US |
dc.identifier.isbn | 1-58113-534-3 | en_US |
dc.identifier.issn | 1727-3463 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/EGWR/EGWR02/125-134 | en_US |
dc.description.abstract | This paper describes a new acceleration technique for rendering algorithms like path tracing, that use so called gathering random walks. Usually in path tracing, each traced path is used in order to compute a contribution to only a single point on the virtual screen. We propose to combine paths traced through nearby screen points in such a way that each path contributes to multiple screen points in a provably good way. Our approach is unbiased and is not restricted to diffuse light scattering. It complements previous image noise reduction techniques for Monte Carlo ray tracing. We observe speed-ups in the computation of indirect illumination of one order of magnitude. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Accelerating Path Tracing by Re-Using Paths | en_US |
dc.description.seriesinformation | Eurographics Workshop on Rendering | en_US |