Low overhead path regeneration
- 作者: Frolov V.1,2, Galaktionov V.1
-
隶属关系:
- Keldysh Institute of Applied Mathematics RAS
- Moscow State University
- 期: 卷 42, 编号 6 (2016)
- 页面: 382-387
- 栏目: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176468
- DOI: https://doi.org/10.1134/S0361768816060025
- ID: 176468
如何引用文章
详细
Monte Carlo Path Tracing is a core light transport technique which is used for modern methods (like BDPT, MLT, VCM and others). One of the main challenge of efficient GPU Path Tracing implementation is inefficient workload caused by paths of different lengths; few threads process the long paths, while other threads are idle. A work distribution technique called “Path Regeneration” is commonly used to solve this problem. We introduce a novel GPU implementation of path regeneration technique called “in place block based path regeneration.” In comparison to previous approaches our algorithm possesses two main advantages: it has lower self-cost and it does not move any per-ray data along threads in memory, thus, our algorithm can be easily integrated to any advanced path tracing technique (like BDPT, MLT and other) or photon mapping. We tested our solution with path tracing using both CUDA and OpenCL.
作者简介
V. Frolov
Keldysh Institute of Applied Mathematics RAS; Moscow State University
编辑信件的主要联系方式.
Email: vfrolov@graphics.cs.msu.ru
俄罗斯联邦, Moscow; Moscow
V. Galaktionov
Keldysh Institute of Applied Mathematics RAS
Email: vfrolov@graphics.cs.msu.ru
俄罗斯联邦, Moscow