Experiences with streaming construction of SAH KD-trees

RT'06: IEEE Symposium on Interactive Ray Tracing 2006, Proceedings

Volumn , Issue , 2006, Pages 89-94

  Popov, Stefan ^a   Günther, Johannes ^a   Seidel, Hans Peter ^a   Slusallek, Philipp ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Bounded variation function; Kd tree construction; Parallelization; Streaming memory access

Indexed keywords

COMPUTATIONAL GEOMETRY; HEURISTIC ALGORITHMS; IMAGE ANALYSIS; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

BOUNDED VARIATION FUNCTION; KD-TREE CONSTRUCTION; PARALLELIZATION; STREAMING MEMORY ACCESS;

RAY TRACING;

EID: 42549158875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2006.280219     Document Type: Conference Paper

References (27)

1. C. Benthin. Realtime Ray Tracing on Current CPU Architectures. PhD thesis, Saarland University, 2006.
2. J. Goldsmith and J. Salmon. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications, 7(5): 14-20, May 1987.
3. J. Günther, H. Friedrich, H.-P. Seidel, and P. Slusallek. Interactive ray tracing of skinned animations. The Visual Computer, Aug. 2006. doi: 10 .1007/S00371-006-0063-X (Proceedings of Pacific Graphics).
4. J. Günther, H. Friedrich, I. Wald, H.-P. Seidel, and P. Slusallek. Ray tracing animated scenes using motion decomposition. Computer Graphics Forum, 25(3), Sept. 2006. (Proceedings of Eurographics).
5. V. Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, 2001.
6. V. Havran, R. Herzog, and H.-P. Seidel. On fast construction of spatial hierarchies for ray tracing. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Sept. 2006.
7. W. Hunt, G. Stoll, and W. Mark. Fast kd-tree construction with an adaptive error-bounded heuristic. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Sept. 2006.
8. IBM. The Cell project at IBM research, http://www.research.ibm.com/cej/, 2005.
9. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, second edition, 1998.
10. C. Lauterbach, S.-E. Yoon, D. Tuft, and D. Manocha. RT-DEFORM interactive ray tracing of dynamic scenes using BVHs. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Sept. 2006.
11. J. Lext and T. Akenine-Möller. Towards rapid reconstruction for animated ray tracing. In Eurographics 2001 - Short Presentations, pages 311-318, 2001.
12. J. D. MacDonald and K. S. Booth. Heuristics for ray tracing using space subdivision. In Graphics Interface Proceedings 1989, pages 152-163, Wellesley, MA, USA, June 1989, A.K. Peters, Ltd.
13. J. D. MacDonald and K. S. Booth. Heuristics for ray tracing using space subdivision. Visual Computer, 6(6): 153-65, 1990.
14. E. Reinhard, B. Smits, and C. Hansen. Dynamic acceleration structures for interactive ray tracing. In Proceedings of the Eurographics Workshop on Rendering, pages 299-306, Brno, Czech Republic, June 2000.
15. A. Reshetov, A. Soupikov, and J. Hurley. Multi-level ray tracing algorithm. ACM Transaction of Graphics, 24(3): 1176-1185, 2005. (Proceedings of ACM SIGGRAPH).
16. L. Santalo. Integral Geometry and Geometric Probability. Cambridge University Press, 2002.
17. R. Sedgewick. Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching. Addison-Wesley, 1998. (3rd Edition).
18. G. Stoll, W. R. Mark, P. Djeu, R. Wang, and I. Elhassan. Razor: An architecture for dynamic multiresolution ray tracing. Technical Report TR-06-21, The University of Texas at Austin, Department of Computer Sciences, 2006. (available at http://www-csl.csres.utexas.edu/users/billmark/papers/razor-TR06/) .
19. K. R. Subramanian. A Search Structure based on kd-Trees for Efficient Ray Tracing. PhD thesis, University of Texas at Austin, Dec. 1990.
20. P. Terdiman. Radix sort revisited, 2000. http://codercorner.com/ RadixSortRevisited.htm.
21. C. Wächter and A. Keller. Instant ray tracing: The bounding interval hierarchy. In Rendering Techniques 2006, Proceedings of the Eurographics Symposium on Rendering, pages 139-149, Aire-la-Ville, Switzerland, June 2006. The Eurographics Association.
22. I. Wald. Realtime Ray Tracing and Interactive Global Illumination. PhD thesis, Saarland University, 2004.
23. I. Wald, C. Benthin, and P. Slusallek. Distributed interactive ray tracing of dynamic scenes. In Proceedings of the IEEE Symposium on Parallel and Large-Data Visualization and Graphics (PVG), pages 77-86, 2003.
24. I. Wald, S. Boulos, and P. Shirley. Ray tracing deformable scenes using dynamic bounding volume hierarchies. SCI Institute Technical Report UUSCI-2006-015, University of Utah, 2006. (conditionally accepted at ACM Transactions on Graphics, available at http://www.sci.utah.edu/~wald/ Publications/webgen/2006/BVH/download/togbvh.pdf).
25. I. Wald and V. Havran. On building fast kd-trees for ray tracing, and on doing that in O(N log N). In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Sept. 2006.
26. I. Wald, T. Ize, A. Kensler, A. Knoll, and S. G. Parker. Ray tracing animated scenes using coherent grid traversal. ACM Transactions on Graphics, 25(3):485-493, 2006. (Proceedings of ACM SIGGRAPH).
27. S. Woop, G. Marmitt, and P. Slusallek. B-kd trees for hardware accelerated ray tracing of dynamic scenes. In Proceedings of Graphics Hardware, 2006.