Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal

Andrey Prokopenko, Damien Lebrun-Grandié

Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to…