Fast Insertion-Based Optimization of Bounding Volume Hierarchies
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Fast Insertion-Based Optimization of Bounding Volume Hierarchies
Original language description
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%.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
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
—
Volume of the periodical
32
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
16
Pages from-to
85-100
UT code for WoS article
000315301700008
EID of the result in the Scopus database
—