On the fast construction of spatial hierarchies for ray tracing

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

Volumn , Issue , 2006, Pages 71-80

  Havran, Vlastimil ^a,b   Herzog, Robert ^a   Seidel, Hans Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Animation; Approximate algorithms; Hierarchical data structures; Ray shooting; Ray tracing; Spatial sorting; Time complexity

Indexed keywords

ANIMATION; APPROXIMATION ALGORITHMS; COMPUTER GRAPHICS; DATA STRUCTURES; HIERARCHICAL SYSTEMS;

RAY SHOOTING; SPATIAL SORTING; TIME COMPLEXITY;

RAY TRACING;

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

References (45)

1. B. Adams, R. Keiser, M. Pauly, L. Guibas, M. Gross, and P. Dutre. Efficient Raytracing of Deformable Point-Sampled Surfaces. In Proceedings of the 2005 Eurographics Conference, pages 677-684.
2. J. Arvo and D. Kirk. A Survey of Ray Tracing Acceleration Techniques, pages 201-262. Academic Press, 1989.
3. J. L. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9):509-517, 1975.
4. A. Y.-H. Chang. Theoretical and Experimental Aspects of Ray Shooting. PhD thesis, Politechnic University, USA, 2004.
5. Y. Chrysanthou and M. Slater. Computing Dynamic Changes to BSP Trees. In A. Kilgour and L. Kjelldahl, editors, Computer Graphics Forum (EUROGRAPHICS '92 Proceedings), volume 11, pages 321-332, September 1992.
6. M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. In Symposium on Computational Geometry, pages 294-303, 1997.
7. V. Gaede and O. Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2): 170-231, 1998.
8. J. Goldsmith and J. Salmon. Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics and Applications, 7(5): 14-20, May 1987.
9. O. Günther and H. Noltemeier. Spatial database indices for large extended objects. In ICDE, pages 520-526. IEEE Computer Society, 1991.
10. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47-57, New York, NYUSA, 1984. ACM Press.
11. V. Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, November 2000.
12. V. Havran, J. Prikryl, and W. Purgathofer. Statistical comparison of ray-shooting efficiency schemes. Technical Report TR-186-2-00-14, May 2000.
13. D. Jevans and B. Wyvill. Adaptive voxel subdivision for ray tracing. Proceedings of Graphics Interface '89, pages 164-172, June 1989.
14. T.L. Kay and J.T. Kajiya. Ray Tracing Complex Scenes. Computer Graphics (Proceedings of ACM SIGGRAPH), 20(4):269-278, 1986.
15. Donald E. Knuth. The Art of Computer Programming, Volume 3 Sorting and Searching. Addison-Wesley, 1998.
16. T. Larsson and T. Akenine-Möller. A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection. In Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations, pages 91-100, Pisa, Italy, November 2005.
17. J. Lext and T. Akenine-Möller. Towards Rapid Reconstruction for Animated Ray Tracing. In Eurographics 2001 - Short Presentations, pages 311-318, 2001.
18. J. Lext, U. Assarsson, and T. Möller. BART: A Benchmark for Animated Ray Tracing. Technical report, Department of Computer Engineering, Chalmers University of Technology, Göteborg, Sweden, May 2000. Available at http://www.ce.chalmers.se/BART/.
19. J. Lext, U. Assarsson, and T. Möller. A Benchmark for Animated Ray Tracing. IEEE Comput. Graph. Appl., 21(2):22-31, 2001.
20. J. D. MacDonald and K. S. Booth. Heuristics for Ray Tracing using Space Subdivision. In Proceedings of Graphics Interface, pages 152-63, 1989.
21. J. Mahovsky. Ray Tracing with Reduced-Precision Bounding Volume Hierarchies. PhD thesis, University of Calgary, 2005.
22. J. P. Molina Masso and P. Gonzalez Lopez. Automatic Hybrid Hierarchy Creation: a Cost-model Based Approach. Computer Graphics Forum. 22(1):5-13, 2003.
23. B. Ooi, K.J. McDonell, and R. Sacks-Davis. Spatial KD-tree: An Indexing Mechanism for Spatial Databases. In Proceedings of the IEEE COMPSAC Conference, 1987.
24. B. C. Ooi, R. Sacks-Davis, and J. Han. Indexing in Spatial Databases, 1993. Unpublished Manuscript, available at: http://www.iscs.nus.edu.sg/~ooibc/.
25. S. Parker, P. Shirley, Y. Livnat, C. Hansen, and P.-P. Sloan. Interactive Ray Tracing. In Proceedings of Interactive 3D Graphics, pages 119-126, 1999.
26. J.H. Reif and S.R. Tate. Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. Algorithmica: An International Journal in Computer Science, 28(3):271-287, 2000.
27. 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.
28. 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).
29. S. M. Rubin and T. Whitted. A Three-Dimensional Representation for Fast Rendering of Complex Scenes. Computer Graphics, 14(3): 110-116, July 1980.
30. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006. to appear.
31. N. Santoro and J. B. Sidney. Interpolation-Binary Search. Inf. Proc. Lett. 20:179-181, 1985.
32. J. Shagam and J. Pfeiffer. Dynamic Irregular Octrees. Technical Report NMSU-CS-2003-004, 2003.
33. P. Shirley and R. K. Morley. Realistic Ray Tracing. A K Peters, second edition, 2003.
34. G. Simiakakis. Accelerating Ray Tracing with Directional Subdivision and Parallel Processing. PhD thesis, University of East Anglia, 1995.
35. P. Slusallek, P. Shirley, I. Wald, G. Stoll, and B. Mark, editors. SIGGRAPH 2005 Course Notes 38 on Interactive Ray Tracing, 2005.
36. O. Sudarsky and C. Gotsman. Dynamic Scene Occlusion Culling. In Hans Hagen, editor, IEEE Transactions on Visualization and Computer Graphics, volume 5 (1), pages 13-29. IEEE Computer Society, 1999.
37. L. Szécsi, B. Benedek, and L. Szirmay-Kalos. Accelerating Animation Through Verification of Shooting Walks. In Proceedings of SCCG, pages 231-238. ACM Press, 2003.
38. L. Szirmay-Kalos, V. Havran, B. Balázs, and L. Szécsi. On the Efficiency of Ray-shooting Acceleration Schemes. In Alan Chalmers, editor, Proceedings of SCCG. pages 89-98. ACM Siggraph, 2002.
39. S.R. Tate and K. Xu. General-Purpose Spatial Decomposition Algorithms: Experimental Results. In Proceedings of ALENEX 00. pages 179-216, 2000.
40. M. Teschner, B. Heidelberger, D. Manocha, N. Govindaraju, G. Zachmann, S. Kimmerle, J. Mezger, and A. Fuhrmann. Collision Handling in Dynamic Simulation Environments. In Eurographics Tutorials, pages 79-185, 2005.
41. I. Wald. Course on Interactive Ray Tracing, Handling Dynamic Scenes. In ACM SIGGRAPH 2005 Course Notes 38, pages 1-25. ACM Press, 2005.
42. 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), 2003.
43. I. Wald and V. Havran. On building fast kd-trees for ray tracing, and on doing that in o(n log n). SCI Institute Technical Report UUSCI-2006-009, University of Utah, 2006.
44. I. Wald, P. Slusallek, C. Benthin, and M. Wagner. Interactive Rendering with Coherent Ray Tracing. Computer Graphics Forum, 20(3): 153-164, 2001. (Proceedings of Eurographics).
45. K. Y. Whang, J. W. Song, J. W. Chang, J. Y. Kim, W. S. Cho, C. M. Park, and I. Y. Song. Octree-R: An adaptive octree for efficient ray tracing. IEEE Transactions on Visualization and Computer Graphics, 1(4):343-349, 1995.