Omnidirectional Ray Tracing Traversal Algorithm for kd-trees
- 1 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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 subgroupsKeywords
This publication has 2 references indexed in Scilit:
- Ray tracing animated scenes using coherent grid traversalACM Transactions on Graphics, 2006
- Multi-level ray tracing algorithmACM Transactions on Graphics, 2005