ABSTRACT
We propose a new massively parallel algorithm for constructing high-quality bounding volume hierarchies (BVHs) for ray tracing. The algorithm is based on modifying an existing BVH to improve its quality, and executes in linear time at a rate of almost 40M triangles/sec on NVIDIA GTX Titan. We also propose an improved approach for parallel splitting of triangles prior to tree construction. Averaged over 20 test scenes, the resulting trees offer over 90% of the ray tracing performance of the best offline construction method (SBVH), while previous fast GPU algorithms offer only about 50%. Compared to state-of-the-art, our method offers a significant improvement in the majority of practical workloads that need to construct the BVH for each frame. On the average, it gives the best overall performance when tracing between 7 million and 60 billion rays per frame. This covers most interactive applications, product and architectural design, and even movie rendering.
Supplemental Material
Available for Download
Supplemental material.
- Aila, T., and Laine, S. 2009. Understanding the efficiency of ray traversal on GPUs. In Proc. High Performance Graphics 2009, 145--149. Google Scholar
Digital Library
- Aila, T., Laine, S., and Karras, T. 2012. Understanding the efficiency of ray traversal on GPUs -- Kepler and Fermi addendum. Tech. Rep. NVR-2012-02, NVIDIA.Google Scholar
- Bittner, J., Hapala, M., and F., H. 2013. Fast insertion-based optimization of bounding volume hierarchies. Computer Graphics Forum 32, 1, 85--100.Google Scholar
Cross Ref
- Dammertz, H., and Keller, A. 2008. The edge volume heuristic -- robust triangle subdivision for improved BVH performance. In Proc. IEEE Symposium on Interactive Ray Tracing, 155--158.Google Scholar
- Ernst, M., and Greiner, G. 2007. Early split clipping for bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 73--78. Google Scholar
Digital Library
- Garanzha, K., Pantaleoni, J., and McAllister, D. K. 2011. Simpler and faster HLBVH with work queues. In Proc. High Performance Graphics, 59--64. Google Scholar
Digital Library
- Garanzha, K., Premoze, S., Bely, A., and Galaktionov, V. 2011. Grid-based SAH BVH construction on a GPU. Visual Computer 27, 6--8, 697--706. Google Scholar
Digital Library
- Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications 7, 5, 14--20. Google Scholar
Digital Library
- Karras, T. 2012. Maximizing parallelism in the construction of BVHs, octrees, and k-d trees. In Proc. High-Performance Graphics 2012, 33--37. Google Scholar
Digital Library
- Kensler, A. 2008. Tree rotations for improving bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 73--76.Google Scholar
Cross Ref
- Kopta, D., Ize, T., Spjut, J., Brunvand, E., Davis, A., and Kensler, A. 2012. Fast, effective BVH updates for animated scenes. In Proc. Interactive 3D Graphics and Games, 197--204. Google Scholar
Digital Library
- Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., and Manocha, D. 2009. Fast BVH construction on GPUs. Computer Graphics Forum 28, 2, 375--384.Google Scholar
- MacDonald, D. J., and Booth, K. S. 1990. Heuristics for ray tracing using space subdivision. Visual Computer 6, 3, 153--166. Google Scholar
Digital Library
- NVIDIA. 2012. NVIDIA OptiX Programming Guide 3.0, November.Google Scholar
- Pantaleoni, J., and Luebke, D. 2010. HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry. In Proc. High Performance Graphics, 87--95. Google Scholar
Digital Library
- Popov, S., Georgiev, I., Dimov, R., and Slusallek, P. 2009. Object partitioning considered harmful: space subdivision for BVHs. In Proc. High Performance Graphics 2009, 15--22. Google Scholar
Digital Library
- Stich, M., Friedrich, H., and Dietrich, A. 2009. Spatial splits in bounding volume hierarchies. In Proc. High-Performance Graphics 2009, 7--13. Google Scholar
Digital Library
- Wald, I. 2007. On fast construction of SAH-based bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 33--40. Google Scholar
Digital Library
- Wald, I. 2012. Fast construction of SAH BVHs on the Intel many integrated core (MIC) architecture. IEEE Trans. Vis. Comput. Graph. 18, 1, 47--57. Google Scholar
Digital Library
- Walter, B., Bala, K., Kulkarni, M., and Pingali, K. 2008. Fast agglomerative clustering for rendering. In Proc. IEEE Symposium on Interactive Ray Tracing, 81--86.Google Scholar
- Woop, S. 2004. A ray tracing hardware architecture for dynamic scenes. Tech. rep., Saarland University.Google Scholar
Index Terms
Fast parallel construction of high-quality bounding volume hierarchies
Recommendations
Ray Specialized Contraction on Bounding Volume Hierarchies
In this paper we propose a simple but effective method to modify a BVH based on ray distribution for improved ray tracing performance. Our method starts with an initial BVH generated by any state-of-the-art offline algorithm. Then by traversing a small ...
GPU Ray Tracing Based on Reduced Bounding Volume Hierarchies
CGIV '12: Proceedings of the 2012 Ninth International Conference on Computer Graphics, Imaging and VisualizationWe present a bounding volume hierarchy construction based on a culling technique for performing ray tracing on manycore GPUs. The objects are divided into view-sets of triangles with respect to a set of view targets (including the camera and the light ...
Parallel On-Demand Hierarchy Construction on Contemporary GPUs
We present the first parallel on-demand spatial hierarchy construction algorithm targeting ray tracing on many-core processors such as GPUs. The method performs simultaneous ray traversal and spatial hierarchy construction focused on the parts of the data ...




Comments