Simpler and faster HLBVH with work queues

Proceedings - HPG 2011: ACM SIGGRAPH Symposium on High Performance Graphics

Volumn , Issue , 2011, Pages 59-64

  Garanzha, Kirill ^a   Pantaleoni, Jacopo ^b   McAllister, David ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

^b NVIDIA   (United States)

Author keywords

Ray tracing; Real time; Spatial index

Indexed keywords

BINARY SEARCH; BOUNDING VOLUME HIERARCHIES; BREADTH-FIRST; CONSTRUCTION SPEED; MEMORY EFFICIENT; REAL-TIME; SPATIAL INDICES; SPATIAL PARTITIONING; TEMPORARY STORAGE; TREE TRAVERSAL;

INTERACTIVE COMPUTER GRAPHICS; PLANT EXTRACTS;

ALGORITHMS;

EID: 80052429047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2018323.2018333     Document Type: Conference Paper

References (16)

1. Ernst, M., and Greiner, G. 2007. Early split clipping for bounding volume hierarchies. Symposium on Interactive Ray Tracing 0, 73-78.
2. Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications 7, 5, 14-20. (Pubitemid 17598108)
3. Kalojanov, J., and Slusallek, P. 2009. A parallel algorithm for construction of uniform grids. In Proceedings of the Conference on High Performance Graphics 2009, ACM, New York, NY, USA, HPG '09, 23-28.
4. Kalojanov, J., Billeter, M., and Slusallek, P. 2011. Two-level grids for ray tracing on GPUs. Computer Graphics Forum (4).
5. Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., and Manocha, D. 2009. Fast bvh construction on GPUs. Comput. Graph. Forum 28, 2, 375-384.
6. Merrill, D., and Grimshaw, A. 2010. Revisiting sorting for GPGPU stream architectures. Tech. Rep. CS2010-03, Department of Computer Science, University of Virginia, February.
7. Nickolls, J., Buck, I., Garland, M., and Skadron, K. 2008. Scalable parallel programming with cuda. ACM Queue 6, 2, 40-53.
8. Pantaleoni, J., and Luebke, D. 2010. HLBVH: Hierarchical LBVH construction for real-time ray tracing of dynamic geometry. In High-Performance Graphics 2010, ACM Siggraph / Eurographics Symposium Proceedings, Eurographics, 87-95.
9. Popov, S., Günther, J., Seidel, H.-P., and Slusallek, P. 2006. Experiences with streaming construction of SAH KD-trees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, 89-94.
10. Shevtsov, M., Soupikov, A., and Kapustin, E. 2007. Highly parallel fast kd-tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum 26, 3, 395-404. (Pubitemid 47606917)
11. Wald, I., Boulos, S., and Shirley, P. 2007. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics 26, 1, 485-493.
12. Wald, I., Mark, W. R., Günther, J., Boulos, S., Ize, T., Hunt, W., Parker, S. G., and Shirley, P. 2007. State of the Art in Ray Tracing Animated Scenes. In Eurographics 2007 State of the Art Reports, Eurographics.
13. Wald, I. 2007. On fast Construction of SAH based Bounding Volume Hierarchies. In Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing, Eurographics.
14. Wald, I. 2010. Fast Construction of SAH BVHs on the Intel Many Integrated Core (MIC) Architecture. IEEE Transactions on Visualization and Computer Graphics. (to appear).
15. Wächter, C., and Keller, A. 2006. Instant ray tracing: The bounding interval hierarchy. In In Rendering Techniques 2006 Proceedings of the 17th Eurographics Symposium on Rendering, Eurographics, 139-149.
16. Zhou, K., Hou, Q., Wang, R., and Guo, B. 2008. Realtime kd-tree construction on graphics hardware. ACM Trans. Graph. 27, 5, 1-11.