Fast Insertion-Based Optimization of Bounding Volume Hierarchies

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00204952" target="_blank" >RIV/68407700:21230/13:00204952 - isvavai.cz</a>

Výsledek na webu

<a href="http://dcgi.felk.cvut.cz/home/bittner/publications/cgf-r2.pdf" target="_blank" >http://dcgi.felk.cvut.cz/home/bittner/publications/cgf-r2.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/cgf.12000" target="_blank" >10.1111/cgf.12000</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Fast Insertion-Based Optimization of Bounding Volume Hierarchies

Popis výsledku v původním jazyce

We present an algorithm for fast optimization of bounding volume hierarchies (BVH) for efficient ray tracing. We perform selective updates of the hierarchy driven by the cost model derived from the surface area heuristic. In each step, the algorithm updates a fraction of the hierarchy nodes to minimize the overall hierarchy cost. The updates are realized by simple operations on the tree nodes: removal, search and insertion. Our method can quickly reduce the cost of the hierarchy constructed by the traditional techniques, such as the surface area heuristic. We evaluate the properties of the proposed method on fourteen test scenes of different complexity including individual objects and architectural scenes. The results show that our method can improve aBVH initially constructed with the surface area heuristic by up to 27% and a BVH constructed with the spatial median split by up to 88%.

Název v anglickém jazyce

Fast Insertion-Based Optimization of Bounding Volume Hierarchies

Popis výsledku anglicky

We present an algorithm for fast optimization of bounding volume hierarchies (BVH) for efficient ray tracing. We perform selective updates of the hierarchy driven by the cost model derived from the surface area heuristic. In each step, the algorithm updates a fraction of the hierarchy nodes to minimize the overall hierarchy cost. The updates are realized by simple operations on the tree nodes: removal, search and insertion. Our method can quickly reduce the cost of the hierarchy constructed by the traditional techniques, such as the surface area heuristic. We evaluate the properties of the proposed method on fourteen test scenes of different complexity including individual objects and architectural scenes. The results show that our method can improve aBVH initially constructed with the surface area heuristic by up to 27% and a BVH constructed with the spatial median split by up to 88%.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

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

COMPUTER GRAPHICS FORUM

ISSN

0167-7055

e-ISSN

—

Svazek periodika

32

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

85-100

Kód UT WoS článku

000315301700008

EID výsledku v databázi Scopus

—