Parallel Reinsertion for Bounding Volume Hierarchy Optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00321628" target="_blank" >RIV/68407700:21230/18:00321628 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/10.1111/cgf.13376" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1111/cgf.13376</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1111/cgf.13376" target="_blank" >10.1111/cgf.13376</a>
Alternative languages
Result language
angličtina
Original language name
Parallel Reinsertion for Bounding Volume Hierarchy Optimization
Original language description
We present a novel highly parallel method for optimizing bounding volume hierarchies (BVH) targeting contemporary GPU architectures. The core of our method is based on the insertion-based BVH optimization that is known to achieve excellent results in terms of the SAH cost. The original algorithm is, however, inherently sequential: no efficient parallel version of the method exists, which limits its practical utility. We reformulate the algorithm while exploiting the observation that there is no need to remove the nodes from the BVH prior to finding their optimized positions in the tree. We can search for the optimized positions for all nodes in parallel while simultaneously tracking the corresponding SAH cost reduction. We update in parallel all nodes for which better position was found while efficiently handling potential conflicts during these updates. We implemented our algorithm in CUDA and evaluated the resulting BVH in the context of the GPU ray tracing. The results indicate that the method is able to achieve the best ray traversal performance among the state of the art GPU-based BVH construction methods.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20202 - Communication engineering and systems
Result continuities
Project
<a href="/en/project/GA18-20374S" target="_blank" >GA18-20374S: Interactive Rendering with Distributed Illumination Computations</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
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
1467-8659
Volume of the periodical
37
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
463-473
UT code for WoS article
000434085600041
EID of the result in the Scopus database
2-s2.0-85051814422