Experiences with Streaming Construction of SAH KD-Trees
- 1 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A major reason for the recent advancements in ray tracing performance is the use of optimized acceleration structures, namely kd-trees based on the surface area heuristic (SAH). Though algorithms exist to build these search trees in O(n log n), the construction times for larger scenes are still high and do not allow for rebuilding the kd-tree every frame to support dynamic changes. In this paper we propose modifications to previous kd-tree construction algorithms that significantly increase the coherence of memory accesses during construction of the kd-tree. Additionally we provide theoretical and practical results regarding conservatively sub-sampling of the SAH cost functionKeywords
This publication has 9 references indexed in Scilit:
- On the Fast Construction of Spatial Hierarchies for Ray TracingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Fast kd-tree Construction with an Adaptive Error-Bounded HeuristicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- B-KD trees for hardware accelerated ray tracing of dynamic scenesPublished by Association for Computing Machinery (ACM) ,2006
- Distributed interactive ray tracing of dynamic scenesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Dynamic Acceleration Structures for Interactive Ray TracingPublished by Springer Nature ,2000
- Heuristics for ray tracing using space subdivisionThe Visual Computer, 1990
- Automatic Creation of Object Hierarchies for Ray TracingIEEE Computer Graphics and Applications, 1987