On building fast kd-trees for ray tracing, and on doing that in O(N log N)

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

Volumn , Issue , 2006, Pages 61-69

  Wald, Ingo ^a   Havran, Vlastimil ^b  

^a UNIVERSITY OF UTAH   (United States)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COST FUNCTIONS; HEURISTIC ALGORITHMS; TREES (MATHEMATICS);

KD-TREES; SURFACE AREA HEURISTIC (SAH);

RAY TRACING;

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

References (30)

1. Mark T. de Berg, Matthew J. Katz, A. Frank van der Stappen, and J. Vleugels. Realistic Input Models for Geometric Algorithms. Algorithmica, 34(1):8197, 2002.
2. Andrew Glassner. An Introduction to Ray Tracing. Morgan Kaufmann, 1989. ISBN 0-12286-160-4.
3. Jeffrey Goldsmith and John Salmon. Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics and Applications, 7(5):14-20, 1987.
4. Johannes Günther, Heiko Friedrich, Ingo Wald, Hans-Peter Seidel, and Philipp Slusallek. Ray Tracing Animated Scenes using Motion Decomposition. In Proceedings of Eurographics, 2006. (to appear).
5. Eric Haines, editor. Ray Tracing News, 1987-2005. http://www.acm.org/tog/resources/RTNews/html/.
6. Vlastimil Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Czech Technical University in Prague, 2001.
7. Vlastimil Havran and Jirí Bittner. On Improving Kd Tree for Ray Shooting. In Proceedings of WSCG, pages 209-216, 2002.
8. Warren Hunt, Gordon Stoll, and William Mark. Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 2006.
9. James T. Hurley, Alexander Kapustin, Alexander Reshetov, and Alexei Soupikov. Fast ray tracing for modern general purpose CPU. In Proceedings of GraphiCon, 2002.
10. inView 1.4 Product Description. http://www.intrace.com/.
11. Donald E. Knuth. The Art of Computer Programming, Volumes 1-3. Addison-Wesley, 1998.
12. Christian Lauterbach, Sung-Eui Yoon, David Tuft, and Dinesh Manocha. RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 2006.
13. J. David MacDonald and Kellogg S. Booth. Heuristics for ray tracing using space subdivision. Visual Computer, 6(6):153-65, 1990.
14. Matt Pharr and Greg Humphreys. Physically Based Rendering : From Theory to Implementation. Morgan Kaufman, 2004.
15. Stefan Popov, Johannes Günther, Hans-Peter Seidel, and Philipp Slusallek. Experiences with Streaming Construction of SAH KD-Trees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 2006.
16. Alexander Reshetov. On building good KD-Trees in the Intel Multi-Level Ray Tracing System, personal communication, 2005.
17. Alexander Reshetov, Alexei Soupikov, and Jim Hurley. Multi-Level Ray Tracing Algorithm. ACM Transaction on Graphics, 24(3):1176-1185, 2005. (Proceedings of ACM SIGGRAPH 2005).
18. Luis Santalo. Integral Geometry and Geometric Probability. Cambridge University Press, 2002. ISBN: 0521523443.
19. Robert Sedgewick. Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching. Addison Wesley, 1998. (3rd Ed.).
20. Gordon Stoll. Part II: Achieving Real Time - Optimization Techniques. In SIGGRAPH 2005 Course on Interactive Ray Tracing. 2005.
21. Gordon Stoll, William R. Mark, Peter Djeu, Rui Wang, and Ikrima Elhassan. Razor: An Architecture for Dynamic Multiresolution Ray Tracing. Technical Report 06-21, University of Texas at Austin Dep. of Comp. Science, 2006.
22. K. R. Subramanian. A Search Structure based on K-d Trees for Efficient Ray Tracing. PhD thesis, The University of Texas at Austin, December 1990.
23. Laászló Szécsi. An Effective Implementation of the kd-Tree. In Jeff Lander, editor, Graphics Programming Methods, pages 315-326. Charles River Media, 2003.
24. Pravin M. Vaidya. An O(N log N) Algorithm for the All-Nearest-Neighbors Problem. Discrete and Computational Geometry. (4):101-115, 1989.
25. Carsten Wächter and Alexander Keller. Instant Ray Tracing: The Bounding Interval Hierarchy. In Proceedings of the 17th Eurographics Symposium on Rendering, 2006.
26. Ingo Wald. Realtime Ray Tracing and Interactive Global Illumination. PhD thesis, Saarland University, 2004.
27. Ingo Wald, Carsten Benthin, and Philipp Slusallek. Distributed Interactive Ray Tracing of Dynamic Scenes. In Proceedings of the IEEE Symposium on Parallel and Large-Data Visualization and Graphics (PVG), 2003.
28. Ingo Wald, Solomon Boulos, and Peter Shirley. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics, (conditionally accepted), 2006. Available as SCI Institute, University of Utah Tech.Rep. UUSCI-2006-023.
29. Ingo Wald, Johannes Günther, and Philipp Slusallek. Balancing Considered Harmful - Faster Photon Mapping using the Voxel Volume Heuristic. Computer Graphics Forum, 22(3):595-603, 2004.
30. Ingo Wald, Philipp Slusallek, Carsten Benthin, and Markus Wagner. Interactive Rendering with Coherent Ray Tracing. Computer Graphics Forum, 20(3):153-164, 2001. (Proceedings of Eurographics).