Spatial splits in bounding volume hierarchies

Proceedings of the HPG 2009: Conference on High-Performance Graphics 2009

Volumn , Issue , 2009, Pages 7-14

  Stich, Martin ^a   Friedrich, Heiko ^a   Dietrich, Andreas ^a  

^a NVIDIA   (United States)

Author keywords

Bounding volume hierarchy; Ray tracing

Indexed keywords

ACCELERATION STRUCTURES; BOUNDING VOLUME HIERARCHIES; BOUNDING VOLUME HIERARCHY; CONSTRUCTION ALGORITHMS; K-D TREE; PREPROCESSING APPROACHES; RAY SHOOTING; SURFACE AREA; TREE CONSTRUCTION;

HEURISTIC METHODS;

ELEMENTARY PARTICLE SOURCES;

EID: 70450169718     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1572769.1572771     Document Type: Conference Paper

References (20)

1. BENTLEY, J. L. 1975. Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM 18, 9, 509-517.
2. DAMMERTZ, H., AND KELLER, A. 2008. The Edge Volume Heuristic - Robust Triangle Subdivision for Improved BVH Performance. IEEE Symposium on Interactive Ray Tracing 2008, 155-158.
3. ERNST, M., AND GREINER, G. 2007. Early Split Clipping for Bounding Volume Hierarchies. Proceedings Eurographics/IEEE Symposium on Interactive Ray Tracing 2007, 73-78.
4. GLASSNER, A. S. 1988. Spacetime Ray Tracing for Animation. IEEE Comput. Graph. Appl. 8, 2, 60-70.
5. GOLDSMITH, J., AND SALMON, J. 1987. Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics and Applications 7, 5 (May), 14-20.
6. HAVRAN, V., HERZOG, R., AND SEIDEL, H.-P. 2006. On the Fast Construction of Spatial Data Structures for Ray Tracing. 71-80.
7. HAVRAN, V. 2000. Heuristic Ray Shooting Algorithms. Ph.D. Thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.
8. HUNT, W., MARK, W. R., AND STOLL, G. 2006. Fast kdtree Construction with an Adaptive Error-Bounded Heuristic. In 2006 IEEE Symposium on Interactive Ray Tracing, IEEE.
9. LAUTERBACH, C., EUI YOON, S., AND MANOCHA, D. 2006. RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs. In In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 39-45.
10. LAUTERBACH, C., GARLAND, M., SENGUPTA, S., LUEBKE, D., AND MANOCHA, D. 2009. Fast BVH Construction on GPUs. Computer Graphics Forum 28, 2, 375-384.
11. LUEBKE, D., AND PARKER, S. 2008. Interactive Ray Tracing with CUDA. NVIDIA Technical Presentation, SIGGRAPH 2008.
12. MACDONALD, J. D., AND BOOTH, K. S. 1989. Heuristics for Ray Tracing using Space Subdivision. In Proceedings of Graphics Interface 1998, 152-163.
13. POPOV, S., GÜNTHER, J., SEIDEL, H.-P., AND SLUSALLEK, P. 2006. Experiences with Streaming Construction of SAH KDTrees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 89-94.
14. SHEVTSOV, M., SOUPIKOV, A., AND KAPUSTIN, A. 2007. Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes. Computer Graphics Forum 26, 3 (September), 395-404.
15. SOUPIKOV, A., SHEVTSOV, M., AND KAPUSTIN, A. 2008. Improving KD-tree Quality at a Reasonable Construction Cost. In Proceedings of the 2008 IEEE Symposium on Interactive Ray Tracing.
16. SUNG, K., AND SHIRLEY, P. 1992. Ray Tracing with the BSPTree. In Graphics Gems III. Academic Press, 271-274.
17. WÄCHTER, C., AND KELLER, A. 2007. Terminating Spatial Hierarchies by A Priori Bounding Memory.
18. WALD, I., BOULOS, S., AND SHIRLEY, P. 2007. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics 26, 1.
19. WALD, I. 2007. On fast Construction of SAH based Bounding Volume Hierarchies. In Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing.
20. ZHOU, K., HOU, Q., WANG, R., AND GUO, B. 2008. Realtime KD-tree Construction on Graphics Hardware. ACM Trans. Graph. 27, 5, 1-11.