Skip to main content
SpringerLink
Log in

Grid-induced bounding volume hierarchy for ray tracing dynamic scenes

  • Original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

This paper proposes a novel method for accelerating ray tracing of animated scenes in which objects are moved, added, or deleted. The method uses two trees with different structures. The first tree is a hierarchical grid tree that is easily generatable from the primitive list and modifiable according to its change. The second tree is a bounding volume hierarchy (BVH) tree, constructed from the first tree with intra-node agglomerative clustering. When the scene is modified, the first tree is updated, and then, the second tree is partially rebuilt for accessed nodes in the first tree. The resulting BVH tree is deterioration-free; it always coincides with the tree generated by frame-wise rebuilding. For applications where a small portion of the scene is modified between frames, the tree formation cost of the proposed method is much lower than frame-wise rebuilding. Experiments showed that the quality of BVH trees generated by this method is comparable to those created by the binned surface area heuristic approach, and that the tree formation speed is faster not only for dynamic scenes but also for static scenes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. Treelets here are defined as connected subgraphs consisting of BVH nodes and being slightly different from those defined in [20] which also include leaf nodes.

References

  1. Goldsmith, J., Salmon, J.: Automatic creation of object hierarchies for ray tracing. IEEE Comput. Graph. Appl. 7(5), 14–20 (1987)

    Article  Google Scholar 

  2. Lext, J., Akenine-Möller, T.: Towards rapid reconstruction for animated ray tracing. In: EUROGRAPHICS 2001 Short Presentations (2001)

  3. Parker, S.G., Bigler, J., Dietrich, A., Friedrich, H., Hoberock, J., Luebke, D., McAllister, D., McGuire, M., Morley, K., Robison, A., Stich, M.: OptiX: a general purpose ray tracing engine. ACM Trans. Graph. 29(4), 66:1-66:13 (2010)

    Article  Google Scholar 

  4. Wald, I., Woop, S., Benthin, C., Johnson, G.S., Ernst, M.: Embree: a kernel framework for efficient CPU ray tracing. ACM Trans. Graph. 33(4), 1431–1438 (2014)

    Article  Google Scholar 

  5. Wald, I., Boulos, S., Shirley, P.: Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Trans. Graph. 26(1), 61–618 (2007)

    Article  Google Scholar 

  6. Wald, I.: On fast construction of SAH-based bounding volume hierarchies. In: Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing, pp. 33–40 (2007)

  7. Lauterbach, C., Garland, M., Sengupta, S., Luebke, D.P., Manocha, D.: Fast BVH construction on GPUs. Comput. Graph. Forum 28(2), 375–384 (2009)

    Article  Google Scholar 

  8. Larsson, T., Akenine-Möller, T.: A dynamic bounding volume hierarchy for generalized collision detection. Comput. Graph. 30(3), 450–459 (2006)

    Article  Google Scholar 

  9. Yoon, S.E., Curtis, S., Manocha, D.: Ray tracing dynamic scenes using selective restructuring. In: Proceedings of the 18th Eurographics Conference on Rendering Techniques, pp. 73–84 (2007)

  10. Kopta, D., Ize, T., Spjut, J., Brunvand, E., Davis, A., Kensler, A.: Fast, effective BVH updates for animated scenes. In: Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, pp. 197–204 (2012)

  11. Lauterbach, C., Yoon, S.E., Tuft, D., Manocha, D.: RT-DEFORM: interactive ray tracing of dynamic scenes using BVHs. In: 2006 IEEE Symposium on Interactive Ray Tracing, pp. 39–46 (2006)

  12. Wald, I., Mark, W.R., Günther, J., Boulos, S., Ize, T., Hunt, W., Parker, S.G., Shirley, P.: State of the art in ray tracing animated scenes. Comput. Graph. Forum 28(6), 1691–1722 (2009)

    Article  Google Scholar 

  13. Fujimoto, A., Tanaka, T., Iwata, K.: ARTS: accelerated ray-tracing system. IEEE Comput. Graph. Appl. 6(4), 16–26 (1986)

    Article  Google Scholar 

  14. Amanatides, J., Woo, A.: A fast voxel traversal algorithm for ray tracing. In: Proceedings of Eurographics '87, pp. 3–10 (1987)

  15. Jevans, D., Wyvill, B.: Adaptive voxel subdivision for ray tracing. In: Proceedings of Graphics Interface '89, pp. 164–172 (1989)

  16. Reinhard, E., Smits, B., Hansen, C.: Dynamic acceleration structures for interactive ray tracing. In: Rendering Techniques, pp. 299–306 (2000)

  17. Pantaleoni, J., Luebke, D.: HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry. In: Proceedings of the Conference on High Performance Graphics, HPG '10, pp. 87–95 (2010)

  18. Garanzha, K., Premože, S., Bely, A., Galaktionov, V.: Grid-based SAH BVH construction on a GPU. Vis. Comput. 27, 697–706 (2011)

    Article  Google Scholar 

  19. Ganestam, P., Barringer, R., Doggett, M., Akenine-Möller, T.: Bonsai: rapid bounding volume hierarchy generation using mini trees. J. Comput. Graph. Technol. 4(3), 23–42 (2015)

    Google Scholar 

  20. Karras, T., Aila, T.: Fast parallel construction of high-quality bounding volume hierarchies. In: Proceedings of the 5th High-Performance Graphics Conference, HPG '13, pp. 89–99 (2013)

  21. Domingues, L.R., Pedrini, H.: Bounding volume hierarchy optimization through agglomerative treelet restructuring. In: Proceedings of the 7th Conference on High-Performance Graphics, HPG '15, pp. 13–20 (2015)

  22. Walter, B., Bala, K., Kulkarni, M., Pingali, K.: Fast agglomerative clustering for rendering. In: 2008 IEEE Symposium on Interactive Ray Tracing, pp. 81–86 (2008)

  23. Meister, D., Bittner, J.: Parallel locally-ordered clustering for bounding volume hierarchy construction. IEEE Trans. Vis. Comput. Graph 24(3), 1345–1353 (2018)

    Article  Google Scholar 

  24. Bittner, J., Hapala, M., Havran, V.: Incremental BVH construction for ray tracing. Comput. Graph. 47(C), 135–144 (2015)

    Article  Google Scholar 

  25. Wald, I., Havran, V.: On building fast kd-trees for ray tracing, and on doing that in O(N log N). In: 2006 IEEE Symposium on Interactive Ray Tracing, pp. 61–69 (2006)

  26. Yang, X., Liu, Q., Zhang, P., Xin, L., Zhou, D., Wang, Y., Zhang, Q., Wei, X.: DKD: a fast k-d tree update design for dynamic scenes. Comp. Anim. Virtual Worlds 27, 340–350 (2016)

    Article  Google Scholar 

  27. Lext, J., Assarsson, U., Möller, T.: A benchmark for animated ray tracing. IEEE Comput. Graph. Appl. 21(2), 22–31 (2001)

    Article  Google Scholar 

Download references

Acknowledgements

Models used are courtesy of their creators. The dragon model is from the Stanford 3D Scanning Repository, the conference model is from the McGuire Computer Graphics Archive, and the fairy and toasters scenes are from the Utah 3D Animation Repository.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, The University of Aizu, Aizuwakamatsu, Fukushima, 965-8580, Japan

    Satoshi Nishimura

Authors
  1. Satoshi Nishimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoshi Nishimura.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nishimura, S. Grid-induced bounding volume hierarchy for ray tracing dynamic scenes. Vis Comput 37, 2965–2974 (2021). https://doi.org/10.1007/s00371-021-02205-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-021-02205-3

Keywords

Search

Navigation