JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]


Journal of Information Science and Engineering, Vol. 29 No. 6, pp. 1211-1225


Ray-Box Culling for Tree Structures


JAE-HO NAH1, WOO-CHAN PARK2, YOON-SIG KANG1 AND TACK-DON HAN1
1Department of Computer Science
Yonsei University
Seoul, 120-749 Korea
2Department of Computer Engineering
Sejong University
Seoul, 43-747 Korea


    Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15x faster ray tracing performance and up to 1.22x faster total rendering performance, including tree construction and ray tracing.


Keywords: ray tracing, ray-box culling, ray-primitive intersection tests, kd-trees, primitive culling

  Retrieve PDF document (JISE_201306_09.pdf)