Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00318435" target="_blank" >RIV/68407700:21230/18:00318435 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7857089/" target="_blank" >http://ieeexplore.ieee.org/document/7857089/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TVCG.2017.2669983" target="_blank" >10.1109/TVCG.2017.2669983</a>

Result language
angličtina
Original language name
Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction
Original language description
We propose a novel massively parallel construction algorithm for Bounding Volume Hierarchies (BVHs) based on locally-ordered agglomerative clustering. Our method builds the BVH iteratively from bottom to top by merging a batch of cluster pairs in each iteration. To efficiently find the neighboring clusters, we keep the clusters ordered along the Morton curve. This ordering allows us to identify approximate nearest neighbors very efficiently and in parallel. We implemented our algorithm in CUDA and evaluated it in the context of GPU ray tracing. For complex scenes, our method achieves up to a twofold reduction of build times while providing up to 17 percent faster trace times compared with the state-of-the-art methods.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

Similar results(10)