Los puntos clave no están disponibles para este artículo en este momento.
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
Alexander Reshetov (Fri,) studied this question.