Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00304420" target="_blank" >RIV/68407700:21230/16:00304420 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14330/16:00089133

Výsledek na webu

<a href="http://onlinelibrary.wiley.com/doi/10.1111/cgf.12776/abstract" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1111/cgf.12776/abstract</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/cgf.12776" target="_blank" >10.1111/cgf.12776</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing

Popis výsledku v původním jazyce

We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for very high performance of tracing rays. To achieve low rendering times, we extensively examine the constants used in termination criteria for the two data structures. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. On the other hand, kd-trees have higher performance for complex scenes, in particular for those with high depth complexity. Finally, we analyse the causes of the performance discrepancies using the profiling characteristics of the ray tracing kernels.

Název v anglickém jazyce

Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing

Popis výsledku anglicky

We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for very high performance of tracing rays. To achieve low rendering times, we extensively examine the constants used in termination criteria for the two data structures. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. On the other hand, kd-trees have higher performance for complex scenes, in particular for those with high depth complexity. Finally, we analyse the causes of the performance discrepancies using the profiling characteristics of the ray tracing kernels.

Druh

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

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimální algoritmy pro syntézu obrazu</a><br>

Návaznosti

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

Rok uplatnění

2016

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

COMPUTER GRAPHICS FORUM

ISSN

0167-7055

e-ISSN

—

Svazek periodika

35

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

68-79

Kód UT WoS článku

000388498500005

EID výsledku v databázi Scopus

2-s2.0-84947297814