Automatic Creation of Object Hierarchies for Ray Tracing
IEEE Computer Graphics and Applications
Graphics Gems III
Multidimensional binary search trees used for associative searching
Communications of the ACM
Spacetime Ray Tracing for Animation
IEEE Computer Graphics and Applications
Ray tracing deformable scenes using dynamic bounding volume hierarchies
ACM Transactions on Graphics (TOG)
Real-time KD-tree construction on graphics hardware
ACM SIGGRAPH Asia 2008 papers
On fast Construction of SAH-based Bounding Volume Hierarchies
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Early Split Clipping for Bounding Volume Hierarchies
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
OptiX: a general purpose ray tracing engine
ACM SIGGRAPH 2010 papers
Restart trail for stackless BVH traversal
Proceedings of the Conference on High Performance Graphics
Implicit and dynamic trees for high performance rendering
Proceedings of Graphics Interface 2011
MSBVH: an efficient acceleration data structure for ray traced motion blur
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Technical Section: Visibility driven BVH build up algorithm for ray tracing
Computers and Graphics
Rasterized Bounding Volume Hierarchies
Computer Graphics Forum
Geometry Presorting for Implicit Object Space Partitioning
Computer Graphics Forum
Ray tracing dynamic scenes with shadows on GPU
EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
A hardware unit for fast SAH-optimised BVH construction
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Fast parallel construction of high-quality bounding volume hierarchies
Proceedings of the 5th High-Performance Graphics Conference
On quality metrics of bounding volume hierarchies
Proceedings of the 5th High-Performance Graphics Conference
Megakernels considered harmful: wavefront path tracing on GPUs
Proceedings of the 5th High-Performance Graphics Conference
GPU-based out-of-core many-lights rendering
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
Bounding volume hierarchies (BVH) have become a widely used alternative to kD-trees as the acceleration structure of choice in modern ray tracing systems. However, BVHs adapt poorly to non-uniformly tessellated scenes, which leads to increased ray shooting costs. This paper presents a novel and practical BVH construction algorithm, which addresses the issue by utilizing spatial splitting similar to kD-trees. In contrast to previous preprocessing approaches, our method uses the surface area heuristic to control primitive splitting during tree construction. We show that our algorithm produces significantly more efficient hierarchies than other techniques. In addition, user parameters that directly influence splitting are eliminated, making the algorithm easily controllable.