Fast Insertion-Based Optimization of Bounding Volume Hierarchies
Article first published online: 22 JAN 2013
© 2013 The Authors Computer Graphics Forum © 2013 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 32, Issue 1, pages 85–100, February 2013
How to Cite
Bittner, J., Hapala, M. and Havran, V. (2013), Fast Insertion-Based Optimization of Bounding Volume Hierarchies. Computer Graphics Forum, 32: 85–100. doi: 10.1111/cgf.12000
- Issue published online: 21 FEB 2013
- Article first published online: 22 JAN 2013
- surface area heuristics;
- ray tracing
- I.3.7[Computer Graphics]: Three-Dimensional Graphics and Realism-Ray Tracing
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%.