Progressive Light Transport Simulation on the GPU: Survey and Improvements

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10290018" target="_blank" >RIV/00216208:11320/14:10290018 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2602144" target="_blank" >http://dx.doi.org/10.1145/2602144</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2602144" target="_blank" >10.1145/2602144</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Progressive Light Transport Simulation on the GPU: Survey and Improvements

Popis výsledku v původním jazyce

/Graphics Processing Units (GPUs) recently became general enough to enable implementation of a variety of light transport algorithms. However, the efficiency of these GPU implementations has received relatively little attention in the research literatureand no systematic study on the topic exists to date. The goal of our work is to fill this gap. Our main contribution is a comprehensive and in-depth investigation of the efficiency of the GPU implementation of a number of classic as well as more recentprogressive light transport simulation algorithms. We present several improvements over the state-of-the-art. In particular, our light vertex cache, a new approach to mapping connections of subpath vertices in bidirectional path tracing on the GPU, outperforms the existing implementations by 30-60%. We also describe a first GPU implementation of the recently introduced vertex connection and merging algorithm [Georgiev et al. 2012], showing that even relatively complex light transport alg

Název v anglickém jazyce

Progressive Light Transport Simulation on the GPU: Survey and Improvements

Popis výsledku anglicky

/Graphics Processing Units (GPUs) recently became general enough to enable implementation of a variety of light transport algorithms. However, the efficiency of these GPU implementations has received relatively little attention in the research literatureand no systematic study on the topic exists to date. The goal of our work is to fill this gap. Our main contribution is a comprehensive and in-depth investigation of the efficiency of the GPU implementation of a number of classic as well as more recentprogressive light transport simulation algorithms. We present several improvements over the state-of-the-art. In particular, our light vertex cache, a new approach to mapping connections of subpath vertices in bidirectional path tracing on the GPU, outperforms the existing implementations by 30-60%. We also describe a first GPU implementation of the recently introduced vertex connection and merging algorithm [Georgiev et al. 2012], showing that even relatively complex light transport alg

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-26189S" target="_blank" >GA13-26189S: Robustní a efektivní simulace transportu světla v libovolném prostředí</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

ACM Transactions on Graphics

ISSN

0730-0301

e-ISSN

—

Svazek periodika

33

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

19

Strana od-do

1-19

Kód UT WoS článku

000337057200008

EID výsledku v databázi Scopus

—