Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing
The result's identifiers
Result code in 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>
Alternative codes found
RIV/00216224:14330/16:00089133
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimal Algorithms for Image Synthesis</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
COMPUTER GRAPHICS FORUM
ISSN
0167-7055
e-ISSN
—
Volume of the periodical
35
Issue of the periodical within the volume
8
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
68-79
UT code for WoS article
000388498500005
EID of the result in the Scopus database
2-s2.0-84947297814