Test for intersection between box and tetrahedron
Helmut Ratschek, Jon George Rokne · International Journal of Computer Mathematics · 1997
A procedure for determining whether a box intersects a tetrahedron is developed. The procedure uses interval arithmetic tools and barycentric coordinates, and it gives a guaranteed answer (modulo rounding errors). The basic geometric idea uses the separating plane approach. The procedure is robust and easy to implement. Numerical examples are given for each of the possible results (i.e., inclusion, overlap and exclusion).