Accelerating Path Tracing by re-using Paths

Bekaert, Philippe; Sbert, Mateu; Halton, John; Debevec, Paul; Gibson, Simon

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Accelerating Path Tracing by re-using Paths

MPS-Authors

/persons/resource/persons44110

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

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.

引用: 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.