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
No takes yet. Share an insight, caveat, or question.
Alexander Reshetov (2006) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: