A raycaster for linear octrees.
This octree traversal implementation uses octant child existence bitmasks to avoid hash table lookup misses.
Based on "An Efficient Parametric Algorithm for Octree Traversal" by J. Revelles et al. (2000)
https://www.researchgate.net/publication/2395157_An_Efficient_Parametric_Algorithm_for_Octree_Traversal
Static
Finds (pseudo) leaf octants that intersect with the given ray.
A linear octree.
A ray.
The intersecting octants. Sorted by distance, closest first.
A raycaster for linear octrees.
This octree traversal implementation uses octant child existence bitmasks to avoid hash table lookup misses.
Based on "An Efficient Parametric Algorithm for Octree Traversal" by J. Revelles et al. (2000)
See
https://www.researchgate.net/publication/2395157_An_Efficient_Parametric_Algorithm_for_Octree_Traversal