Bounding Volume Hierarchies III

FindIntersection(Ray ray, Node node)

{

// Find intersections with child node bounding volumes

...

// Sort intersections front to back

...

// Process intersections (checking for early termination)

min_t = infinity;

for each intersected child i {

if (min_t < bv_t[i]) break;

shape_t = FindIntersection(ray, child);

if (shape_t < min_t) { min_t = shape_t;}

}

return min_t;

}

Sort hits & detect early termination