Performance Comparison of Bounding Volume Hierarchies 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%2F22%3A00360785" target="_blank" >RIV/68407700:21230/22:00360785 - isvavai.cz</a>
Result on the web
<a href="https://jcgt.org/published/0011/04/01/" target="_blank" >https://jcgt.org/published/0011/04/01/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Performance Comparison of Bounding Volume Hierarchies for GPU Ray Tracing
Original language description
Ray tracing is an inherent component of modern rendering algorithms. The bounding volume hierarchy (BVH) is a commonly used acceleration data structure employed in most ray tracing frameworks. Through the last decade, many methods addressing ray tracing with bounding volume hierarchies have been proposed. However, most of these methods were typically compared to only one or two reference methods. The acceleration provided by a particular BVH depends heavily on its construction algorithm. Even experts in the field dispute which method is the best. To add more insight into this challenge, we empirically compare the most popular methods addressing BVHs in the context of GPU ray tracing. Moreover, we combine the construction algorithms with other enhancements such as spatial splits, ray reordering, and wide BVHs. To estimate how close we are from the best performing BVH, we propose a novel method using global optimization with simulated annealing and combine it with the existing best-performing BVH builders. For the sake of fairness and consistency, all methods are evaluated in a single unified framework, and we make all source code publicly available. We also study the correlation between tracing times and the estimated traversal cost induced by the surface area heuristic (SAH).
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
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
the Journal of Computer Graphics Techniques
ISSN
2331-7418
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
October
Country of publishing house
GB - UNITED KINGDOM
Number of pages
19
Pages from-to
1-19
UT code for WoS article
—
EID of the result in the Scopus database
—