Bounding volume hierarchy traversal
= Bounding volume hierarchy traversal
A <bounding volume hierarchy traversal> visits only nodes whose ancestors passed a <conservative enclosure test>. It can use <depth-first search>; its <time complexity> depends on how many nodes pass, not just the <height of a binary tree>.
// Target: optics.bigb