Efficient Strategies for Acceleration Structure Updates in Interactive Ray Tracing Applications on the Cell Processor

  • Martin Weier
  • Thorsten Roth
  • André Hinkenjann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5875)


We present fast complete rebuild strategies, as well as adapted intelligent local update strategies for acceleration data structures for interactive ray tracing environments. Both approaches can be combined. Although the proposed strategies could be used with other data structures and architectures as well, they are currently tailored to the Bounding Interval Hierarchy on the Cell chip.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Popov, S., Gunther, J., Seidel, H.P., Slusallek, P.: Stackless kd-Tree Traversal for High Performance GPU Ray Tracing. In: Computer Graphics Forum (Proc. Eurographics) 26, vol. 3, pp. 415–424 (2007)Google Scholar
  2. 2.
    Wald, I., Havran, V.: On Building Fast kd-trees for Ray Tracing, and on doing that in O(N log N). In: Proc. of IEEE Symp. on Interactive Ray Tracing, pp. 61–69 (2006)Google Scholar
  3. 3.
    Ize, T., Wald, I., Robertson, C., Parker, S.: An Evaluation of Parallel Grid Construction for Ray Tracing Dynamic Scenes. In: Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Salt Lake City, Utah, pp. 47–55 (2006)Google Scholar
  4. 4.
    Lauterbach, C., Yoon, S., Tuft, D., Manocha, D.: RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs. In: IEEE Symposium on Interactive Ray Tracing, Salt Lake City, Utah (2006)Google Scholar
  5. 5.
    Wald, I., Boulos, S., Shirley, P.: Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics 26(1) (2007)Google Scholar
  6. 6.
    Eisemann, M., Grosch, T., Magnor, M., Müller, S.: Automatic Creation of Object Hierarchies for Ray Tracing Dynamic Scenes. In: Skala, V., ed.: WSCG Short Papers Post-Conference Proceedings, WSCG (2007)Google Scholar
  7. 7.
    Popov, S., Günther, J., Seidel, H.P., Slusallek, P.: Experiences with Streaming Construction of SAH kd-Trees. In: Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Utah, pp. 89–94 (2006)Google Scholar
  8. 8.
    Hunt, W., Mark, W.R., Stoll, G.: Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic. In: 2006 IEEE Symposium on Interactive Ray Tracing (2006)Google Scholar
  9. 9.
    Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time kd-tree Construction on Graphics Hardware. ACM Trans. Graph. 27, 1–11 (2008)Google Scholar
  10. 10.
    Wald, I., Ize, T., Kensler, A., Knoll, A., Parker, S.G.: Ray Tracing Animated Scenes using Coherent Grid Traversal. In: ACM Transactions on Graphics 25: Proceedings of ACM SIGGRAPH 2006, Boston, MA, vol. 3, pp. 485–493 (2006)Google Scholar
  11. 11.
    Ize, T., Wald, I., Parker, S.G.: Asynchronous BVH Construction for Ray Tracing Dynamic Scenes on Parallel Multi-Core Architectures. In: Favre, J.M., dos Santos, L.P., Reiners, D. (eds.) Eurographics Symposium on Parallel Graphics and Visualization (2007)Google Scholar
  12. 12.
    Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., Manocha, D.: Fast BVH Construction on GPUs. In: Proc. Eurographics 2009, München, Germany, vol. 28 (2009)Google Scholar
  13. 13.
    Zhou, K., Gong, M., Huang, X., Guo, B.: Highly Parallel Surface Reconstruction. Technical Report MSR-TR-2008-53, Microsoft Technical Report (2008)Google Scholar
  14. 14.
    Ajmera, P., Goradia, R., Chandran, S., Aluru, S.: Fast, Parallel, GPU-based Construction of Space Filling Curves and Octrees. In: SI3D 2008: Proceedings of the 2008 Symposium on Interactive 3D Graphics and Games, Electronic Arts Campus. ACM, New York (2008)Google Scholar
  15. 15.
    Wächter, C., Keller, E.: Instant Ray Tracing: The Bounding Interval Hierarchy. In: Rendering Techniques 2006: Proceedings of the 17th Eurographics Symposium on Rendering, Nicosia, Cyprus, pp. 139–149 (2006)Google Scholar
  16. 16.
    Kahle, J.A., Day, M.N., Hofstee, H.P., Johns, C.R., Maeurer, T.R., Shippy, D.: Introduction to the Cell Multiprocessor. IBM J. Res. Dev. 49, 589–604 (2005)CrossRefGoogle Scholar
  17. 17.
    Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, vol. 2. Addison Wesley Pub. Co. Inc., Reading (2003)Google Scholar
  18. 18.
    Johnstone, M.S., Wilson, P.R.: The Memory Fragmentation Problem: Solved? In: ISMM 1998: Proceedings of the 1st International Symposium on Memory Management, pp. 26–36. ACM, New York (1998)CrossRefGoogle Scholar
  19. 19.
    Berger, E.D., Zorn, B.G., McKinley, K.S.: Composing High-Performance Memory Allocators. In: PLDI 2001: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, pp. 114–124. ACM, New York (2001)CrossRefGoogle Scholar
  20. 20.
    Pharr, M., Humphreys, G.: Physically Based Rendering: From Theory to Implementation (The Interactive 3d Technology Series). Morgan Kaufmann, San Francisco (2004)Google Scholar
  21. 21.
    Goldsmith, J., Salmon, J.: Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Comput. Graph. Appl. 7, 14–20 (1987)CrossRefGoogle Scholar
  22. 22.
    No author given: Parallel radix sort on cell (2007), http://sourceforge.net/projects/sorting-on-cell/ (last viewed, 28.02.09)
  23. 23.
    Ramprasad, N., Baruah, P.K.: Radix sort on the Cell Broadband Engine. Department of Mathematics and Computer Science, Sri Sathya Sai University (2007), www.hipc.org/hipc2007/posters/radix-sort.pdf (last viewed, 10.02.09)
  24. 24.
    Guofu, F., Xiaoshe, D., Xuhao, W., Ying, C., Xingjun, Z.: An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture. Int. J. Distrib. Sen. Netw. 5, 16–16 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Martin Weier
    • 1
  • Thorsten Roth
    • 1
  • André Hinkenjann
    • 1
  1. 1.Computer Graphics LabBonn-Rhein-Sieg University of Applied SciencesSankt AugustinGermany

Personalised recommendations