Abstract
We present an efficient algorithm for building an adaptive bounding volume hierarchy (BVH) in linear time on commodity graphics hardware using CUDA. BVHs are widely used as an acceleration data structure to quickly ray trace animated polygonal scenes. We accelerate the construction process with auxiliary grids that help us build high quality BVHs with SAH in O(k∗n). We partition scene triangles and build a temporary grid structure only once. We also handle non-uniformly tessellated and long/thin triangles that we split into several triangle references with tight bounding box approximations. We make no assumptions on the type of geometry or animation motion. However, our algorithm takes advantage of coherent geometry layout and coherent frame-by-frame motion. We demonstrate the performance and quality of resulting BVHs that are built quickly with good spatial partitioning.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Aila, T., Laine, S.: Understanding the efficiency of ray traversal on GPUs. In: Proc. High-Performance Graphics 2009, pp. 145–149 (2009)
Choi, B., Komuravelli, R., Lu, V., Sung, H., Bocchino, R.L., Adve, S.V., Hart, J.C.: Parallel SAH k-D tree construction. In: Proceedings of High Performance Graphics (2010)
Foley, T., Sugerman, J.: KD-tree acceleration structures for a GPU raytracer. In: Graphics Hardware 2005, pp. 15–22 (2005)
Garanzha, K., Loop, C.: Fast ray sorting and breadth-first packet traversal for GPU ray tracing. Comput. Graph. Forum 29(2) (2010)
Goldsmith, J., Salmon, J.: Automatic creation of object hierarchies for ray tracing. IEEE Comput. Graph. Appl. 7(5), 14–20 (1987)
Havran, V.: Heuristic ray shooting algorithms. Ph.D. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2000)
Ize, T., Wald, I., Parker, S.G.: Asynchronous BVH construction for ray tracing dynamic scenes on parallel multi-core architectures. In: Proceedings of the 2007 Eurographics Symposium on Parallel Graphics and Visualization (2007)
Kalojanov, J., Slusallek, P.: A parallel algorithm for construction of uniform grids. In: HPG’09: Proceedings of the 1st ACM conference on High Performance Graphics, pp. 23–28 (2009)
Kalojanov, J., Billeter, M., Slusallek, P.: Two-level grids for ray tracing on gpus. In: Eurographics 2011. Comput. Graph. Forum 30(2) (2011)
Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., Manocha, D.: Fast BVH construction on GPUs. Comput. Graph. Forum 28(2), 375–384 (2009)
Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable parallel programming with CUDA. ACM Queue 6(2), 40–53 (2008)
Pantaleoni, J., Luebke, D.: HLBVH: Hierarchical LBVH construction for real-time ray tracing. In: High Performance Graphics (2010)
Popov, S., Günther, J., Seidel, H.P., Slusallek, P.: Stackless KD-tree traversal for high performance GPU ray tracing. Comput. Graph. Forum 26(3), 415–424 (2007)
Satish, N., Harris, M., Garland, M.: Designing efficient sorting algorithms for manycore GPUs. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (2009)
Shevtsov, M., Soupikov, A., Kapustin, A.: Highly parallel fast kd-tree construction for interactive ray tracing of dynamic scenes. Comput. Graph. Forum 26(3) (2007)
Stich, M., Friedrich, H., Dietrich, A.: Spatial splits in bounding volume hierarchies. In: Proc. High-Performance Graphics (2009)
Wachter, C., Keller, A.: Instant ray tracing: The bounding interval hierarchy. In: Proceedings of the 17th Eurographics Symposium on Rendering, pp. 139–149 (2006)
Wald, I.: On fast Construction of SAH based bounding volume hierarchies. In: Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing (2007)
Wald, I., Boulos, S., Shirley, P.: Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Trans. Graph. 26(1) (2007)
Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time KD-tree construction on graphics hardware. ACM Trans. Graph. 27(5), 126:1–126:11 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Garanzha, K., Premože, S., Bely, A. et al. Grid-based SAH BVH construction on a GPU. Vis Comput 27, 697–706 (2011). https://doi.org/10.1007/s00371-011-0593-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-011-0593-8