Original Post
Iam working on some collision detection algorithms, and my current state is working on optimizing polygon collision. I have it that currently it takes 1 + N planes to solve, where 1 is the face plane, and N are the planes which are orthogonal to the edges of the polygon, in other words, N is the number of edges of the polygon. What I am doing, is checking to see if the object has intersected or is behind the face plane, then checking to see if it is in front of all of the orthogonal planes,if they are, the object has collided with the polygon. Is there anyway to optimize this while not getting any false positives, or atleast only a small chance of false positives( <5%)?