Skip to main content
SpringerLink
Log in

Fast BVH construction and refit for ray tracing of dynamic scenes

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

As the complexity of virtual environments increases, it becomes a critical issue to ray tracing of dynamic scenes interactively. In this paper, we propose an effective method to address this issue. Firstly, we improve the Surface Area Heuristics (SAH) based bounding volume hierarchies (BVHs) construction algorithm and present a sub-interval search criterion for predicting the optimal split plane position. Compared with the standard SAH approach, our algorithm is much faster but has a little quality degradation. Secondly, we present two new BVH refitting operations, which could run fast and obtain considerable quality of BVHs. The two operations are general and applicable to complex and dynamic scenes including a wide range of deformation. Lastly we use multithread to handle the dynamic scenes during animation, one thread for BVHs rebuilding asynchronously, the others for BVHs refitting and ray tracing. The results of this experiment show that our method is effective. Compared with the previous works, it obtains higher and smoother frame rate.

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Garanzha K (2008) Efficient clustered BVH update algorithm for highly-dynamic models. 2008 IEEE Symposium on Interactive Ray Tracing 2008, pp 123–130

  2. Gui R, Graybill FA, Burdick RK, Ting N (1995) Confidence intervals on ratios of linear combinations for non-disjoint sets of expected mean squares. J Stat Plan Infer 48(2):215–227

    Article  MATH  MathSciNet  Google Scholar 

  3. Hanli Z, Wang CCL, Chen Y, Xiaogang J (2011) Parallel and efficient boolean on polygonal solids. Visual Comput 27(6–8):507–517

    Google Scholar 

  4. Hapala M, Havran V (2011) Review: kd-tree traversal algorithms for ray tracing. Comput Graph Forum 30(1):199–213

    Article  Google Scholar 

  5. Havran V, Herzog R, Seidel H-P (2006) On fast construction of spatial hierarchies for ray tracing. IEEE Symp Interact Ray Tracing 2006:71–80

    Article  Google Scholar 

  6. Hunt W, Mark WR, Stoll G (2006) Fast kd-tree construction with an adaptive error-bounded heuristic. IEEE Symp Interact Ray Tracing 2006:81–88

    Article  Google Scholar 

  7. Hurley J, Kapustin A, Reshetov A, Soupikov A (2011) Fast ray tracing for modern general purpose CPU. International Conference Graphicon 2002:209–218

  8. Kun Z, Gong M, Huang X, Guo B (2010) Data-parallel octrees for surface reconstruction. IEEE Trans Vis Comput Graph 17(5):669–681

    Google Scholar 

  9. Kun Z, Qiming H, Rui W, Baining G (2008) Real-time kd-tree construction on graphics hardware. ACM Trans Graph 27(5):126–137

    Google Scholar 

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

  11. MacDonald JD, Booth KS (1990) Heuristics for ray tracing using space subdivision. Vis Comput 6(3):152–163

    Google Scholar 

  12. Pina JL, Cerezo E, Seron F (2011) Semantic visualization of 3D urban environments. Multimed Tools Appl 59(2):505–521

    Article  Google Scholar 

  13. Stoll G, Part II: Achieving Real Time - Optimization Techniques (2005) In SIGGRAPH 2005 course on interactive ray tracing

  14. Teschner M, Kimmerle S, Heidelberger B, Zachmann G, Raghupathi L, Fuhrmann A, Magnenat-Thalmann N, Strasser P, Volino P (2005) Collision detection for deformable objects. Comput Graph Forum 24(1):61–81

    Google Scholar 

  15. Wächter C, Keller A (2006) Instant ray tracing: the bounding interval hierarchy. In: Proceedings of the 17th Eurographics Symposium on Rendering, pp 132–142

  16. Wald I, Boulos S, Shirley P (2007) Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Trans Graph 26(6):25–32

    Google Scholar 

  17. Wald I, Havran V (2006) On building fast kd-trees for ray tracing and on doing that in O(nlogn). IEEE Symp Interact Ray Tracing 2006:61–69

    Article  Google Scholar 

  18. Wald I, Ize T, Kensler A, Knoll A, Parker S (2006) Ray tracing animated scenes using coherent grid traversal. ACM Trans Graph 25(3):485–493

    Article  Google Scholar 

  19. Wald I, Ize T, Parker SG (2008) Fast parallel and asynchronous construction of BVHs for ray tracing animated scenes. Comput Graph 32(1):3–13

    Google Scholar 

  20. Yoon SE, Crutis S, Manocha D (2007) Ray tracing dynamic scenes using selective restructuring. In: Proceedings of the Eurographics Symposium on Rendering, pp 31–45

Download references

Acknowledgments

This research work has been partially supported by National High-tech Research & Development Program of China under Grant NO.2010AA804022.

Author information

Authors and Affiliations

  1. Huazhong University of Science & Technology, 1037 Luoyu Road, Wuhan, China

    Mingqiang Yin & Shiqi Li

Authors
  1. Mingqiang Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shiqi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingqiang Yin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, M., Li, S. Fast BVH construction and refit for ray tracing of dynamic scenes. Multimed Tools Appl 72, 1823–1839 (2014). https://doi.org/10.1007/s11042-013-1476-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-013-1476-y

Keywords

Search

Navigation