Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

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

IEEE Transactions on Visualization and Computer Graphics

ISSN

1077-2626

e-ISSN

1941-0506

Svazek periodika

24

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

9

Strana od-do

1345-1353

Kód UT WoS článku

000423541200010

EID výsledku v databázi Scopus

2-s2.0-85041312859