Bounding volume hierarchy optimization through agglomerative treelet restructuring

ABSTRACT

In this paper, we present a new method for building high-quality bounding volume hierarchies (BVHs) on manycore systems. Our method is an extension of the current state-of-the-art on GPU BVH construction, Treelet Restructuring Bounding Volume Hierarchy (TRBVH), and consists of optimizing an already existing tree by rearranging subsets of its nodes using a bottom-up agglomerative clustering approach. We implemented our solution for the NVIDIA Kepler architecture using CUDA and tested it on 16 distinct scenes, most of which are commonly used to evaluate the performance of acceleration structures. We show that our implementation is capable of producing trees whose quality is on par with the ones generated by TRBVH for those scenes, while being about 30% faster to do so.

References

1. Aila, T., and Laine, S. 2009. Understanding the efficiency of ray traversal on GPUs. In Proceedings of the High-Performance Graphics Conference, ACM, 145--149.
2. Aila, T., Laine, S., and Karras, T. 2012. Understanding the efficiency of ray traversal on GPUs -- Kepler and Fermi addendum. NVIDIA Technical Report NVR-2012-02, NVIDIA Corporation, June.
3. Aila, T., Karras, T., and Laine, S. 2013. On quality metrics of bounding volume hierarchies. In Proceedings of the High-Performance Graphics Conference, ACM, 101--107.
4. Apetrei, C. 2014. Fast and simple agglomerative LBVH construction. In Computer Graphics and Visual Computing, The Eurographics Association.
5. Bittner, J., Hapala, M., and Havran, V. 2013. Fast insertion-based optimization of bounding volume hierarchies. Computer Graphics Forum 32, 1 (Feb.), 85--100.
6. Bittner, J., Hapala, M., and Havran, V. 2015. Incremental BVH construction for ray tracing. Computers & Graphics 47 (Apr.), 135--144.
7. Garanzha, K., Pantaleoni, J., and McAllister, D. 2011. Simpler and faster HLBVH with work queues. In Proceedings of the High-Performance Graphics Conference, ACM, 59--64.
8. Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications 7, 5 (May), 14--20.
9. Gu, Y., He, Y., Fatahalian, K., and Blelloch, G. 2013. Efficient BVH construction via approximate agglomerative clustering. In Proceedings of the High-Performance Graphics Conference, ACM, 81--88.
10. Gunther, J., Popov, S., Seidel, H.-P., and Slusallek, P. 2007. Realtime ray tracing on GPU with BVH-based packet traversal. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 113--118.
11. Havran, V., Herzog, R., and Seidel, H.-P. 2006. On the fast construction of spatial hierarchies for ray tracing. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 71--80.
12. Karras, T., and Aila, T. 2013. Fast parallel construction of high-quality bounding volume hierarchies. In Proceedings of the High-Performance Graphics Conference, ACM, 89--99.
13. Karras, T., and Aila, T., 2014. Agglomerative treelet restructuring for bounding volume hierarchies. U.S. Patent Applications Publication No. US20140365529 A1, filed 10/28/2013.
14. Karras, T. 2012. Maximizing parallelism in the construction of BVHs, octrees, and K-d trees. In Proceedings of the High-Performance Graphics Conference, Eurographics Association, 33--37.
15. Kensler, A. 2008. Tree rotations for improving bounding volume hierarchies. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 73--76.
16. Lauterbach, C., Garland, M., Sengupta, S., Luebke, D. P., and Manocha, D. 2009. Fast BVH construction on GPUs. Computer Graphics Forum 28, 2 (Apr.), 375--384.
17. MacDonald, D. J., and Booth, K. S. 1990. Heuristics for ray tracing using space subdivision. The Visual Computer: International Journal of Computer Graphics 6, 3 (May), 153--166.
18. Pantaleoni, J., and Luebke, D. 2010. HLBVH: Hierarchical LBVH construction for real-time ray tracing of dynamic geometry. In Proceedings of the High-Performance Graphics Conference, Eurographics Association, 87--95.
19. Stich, M., Friedrich, H., and Dietrich, A. 2009. Spatial splits in bounding volume hierarchies. In Proceedings of the High-Performance Graphics Conference, ACM, 7--13.
20. Vinkler, M., Havran, V., and Bittner, J. 2014. Bounding volume hierarchies versus kd-trees on contemporary many-core architectures. In Proceedings of the 30th Spring Conference on Computer Graphics, ACM, 29--36.
21. Wald, I., Boulos, S., and Shirley, P. 2007. Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Transaction on Graphics 26, 1 (Jan.), 1--18.
22. Wald, I., Ize, T., and Parker, S. G. 2008. Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes. Computers & Graphics 32, 1 (Feb.), 3--13.
23. Wald, I. 2007. On fast construction of SAH-based bounding volume hierarchies. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 33--40.
24. Walter, B., Bala, K., Kulkarni, M., and Pingali, K. 2008. Fast agglomerative clustering for rendering. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 81--86.

Index Terms

• Computing methodologies

  • Computer graphics

    • Rendering

      • Ray tracing