Premium
Fast Insertion‐Based Optimization of Bounding Volume Hierarchies
Author(s) -
Bittner Jiří,
Hapala Michal,
Havran Vlastimil
Publication year - 2013
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12000
Subject(s) - bounding volume , computer science , bounding overwatch , heuristic , hierarchy , ray tracing (physics) , tree (set theory) , algorithm , container (type theory) , simple (philosophy) , tracing , mathematical optimization , mathematics , collision detection , artificial intelligence , mechanical engineering , mathematical analysis , philosophy , physics , computer security , engineering , epistemology , quantum mechanics , economics , market economy , collision , operating system
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 a BVH initially constructed with the surface area heuristic by up to 27% and a BVH constructed with the spatial median split by up to 88%.