Omnidirectional Ray Tracing Traversal Algorithm for kd-trees

Abstract

We propose a new kd-tree traversal algorithm for incoherent groups of rays which reduces number of intersection tests by more than 1.5times compared with splitting the group into coherent subgroups