Original Post
Hi, i have this problem: I am trying to implement collision detection of triangle vs triangle (2D) by making 3 planes of 1 triangle and testing another triangles vertices against that planes. If i found one plane that has all of the vertices on the side of normal (outside of triangle) then i consider that triangles are not colliding. This works fine, except for this: 
(ignore the yellow line) the white lines are the planes as you can see the smaller's triangle's vertices are in back of all 3 planes, and triangles don't intersect... Well, maybe i didn't understood the algorithm or something, how can i fix this if possible, or do i need to pick another algorith(links would be great)? What are common ways to solve triangle vs triangle collision detection? I was thinking about doing segments out of triangles and testing their collisions, but after that i need to check for triangle inside triangle, but i think it's going to be slower than the algorithm above. Well, anyway, your thoughts how to solve this...
(ignore the yellow line) the white lines are the planes as you can see the smaller's triangle's vertices are in back of all 3 planes, and triangles don't intersect... Well, maybe i didn't understood the algorithm or something, how can i fix this if possible, or do i need to pick another algorith(links would be great)? What are common ways to solve triangle vs triangle collision detection? I was thinking about doing segments out of triangles and testing their collisions, but after that i need to check for triangle inside triangle, but i think it's going to be slower than the algorithm above. Well, anyway, your thoughts how to solve this...
