Fast Polygon–Cube Intersection Testing
This gem generalizes previous triangle–cube intersection methods (Voorhies 1992) to support arbitrary n-gons. Convex, concave, self-intersecting, and degenerate polygons are fully treated, and the new algorithm is more efficient and robust. The implementation uses the C vector macro library vec.h created by the second author ( page 404).
Efficient polygon–cube intersection testing is an important problem in computer graphics. Renderers can profit from fast polygon tests against display ...