High performance triangle versus box intersection checks

Checking if a triangle intersects a box is a fundamental part of computer graphics algorithms and should be both robust and highly optimized for higher level algorithms to work correctly and efficiently. This paper analyzes and presents an improved and more robust version of the current state-of-the-art algorithm for determining intersection between a triangle and a box. This algorithm has been rewritten so that it makes use of the instructions found in current processors. This decreases the time it takes to perform a single intersection check by 25%. Furthermore, we analyze how parallel intersection checks can be performed. We measure the parallel performance using several parallel hardware platforms. The results show that using parallel intersection checks, the throughput can be improved by a total of 72%.