Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Accelerating Path Tracing by re-using Paths


Bekaert,  Philippe
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Bekaert, P., Sbert, M., & Halton, J. (2002). Accelerating Path Tracing by re-using Paths. In Rendering Techniques 2002 (pp. 124-135). Aire-la-Ville, Switzerland: Eurographics.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2ED6-D
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.