A DDA Octree Traversal Algorithm for Ray Tracing
Kelvin Sung · Eurographics · 1991
A spatial traversal algorithm for ray tracing that combines the memory efficiency of an octree and the traversal speed of a uniform voxel space is described. A new octree representation is proposed and an implementation of the algorithm based on that representation is presented. Performance of the implementation and other spatial structure traversal algorithms are examined.