An Efficient and Robust Ray-Box Intersection Algorithm

The computational bottleneck in a ray tracer using bounding volume hierarchies is often the ray intersection routine with axis-aligned bounding boxes. We describe a version of this routine that uses IEEE numerical properties to ensure that those tests are both robust and efficient. Sample source code is available online.

Authors: 
Amy Williams (MIT)
Steve Barrus (University of Utah)
R. Keith Morley (University of Utah)
Peter Shirley (University of Utah)
Publication Date: 
Saturday, January 1, 2005
Uploaded Files: