skip to main content
10.1145/2492045.2492055acmconferencesArticle/Chapter ViewAbstractPublication PageshpgConference Proceedingsconference-collections
research-article

Fast parallel construction of high-quality bounding volume hierarchies

Published:19 July 2013Publication History

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.

Skip Supplemental Material Section

Supplemental Material

References

  1. Aila, T., and Laine, S. 2009. Understanding the efficiency of ray traversal on GPUs. In Proc. High Performance Graphics 2009, 145--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle Scholar
  3. Bittner, J., Hapala, M., and F., H. 2013. Fast insertion-based optimization of bounding volume hierarchies. Computer Graphics Forum 32, 1, 85--100.Google ScholarGoogle ScholarCross RefCross Ref
  4. 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 ScholarGoogle Scholar
  5. Ernst, M., and Greiner, G. 2007. Early split clipping for bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 73--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Garanzha, K., Pantaleoni, J., and McAllister, D. K. 2011. Simpler and faster HLBVH with work queues. In Proc. High Performance Graphics, 59--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications 7, 5, 14--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Karras, T. 2012. Maximizing parallelism in the construction of BVHs, octrees, and k-d trees. In Proc. High-Performance Graphics 2012, 33--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Kensler, A. 2008. Tree rotations for improving bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 73--76.Google ScholarGoogle ScholarCross RefCross Ref
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle Scholar
  13. MacDonald, D. J., and Booth, K. S. 1990. Heuristics for ray tracing using space subdivision. Visual Computer 6, 3, 153--166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. NVIDIA. 2012. NVIDIA OptiX Programming Guide 3.0, November.Google ScholarGoogle Scholar
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. Stich, M., Friedrich, H., and Dietrich, A. 2009. Spatial splits in bounding volume hierarchies. In Proc. High-Performance Graphics 2009, 7--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Wald, I. 2007. On fast construction of SAH-based bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing, 33--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle Scholar
  21. Woop, S. 2004. A ray tracing hardware architecture for dynamic scenes. Tech. rep., Saarland University.Google ScholarGoogle Scholar

Index Terms

  1. Fast parallel construction of high-quality bounding volume hierarchies

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      HPG '13: Proceedings of the 5th High-Performance Graphics Conference
      July 2013
      149 pages
      ISBN:9781450321358
      DOI:10.1145/2492045

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 19 July 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      HPG '13 Paper Acceptance Rate15of44submissions,34%Overall Acceptance Rate15of44submissions,34%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader