I'm implementing octrees which will contain a list of triangles. What is a good algorithm to test whether a triangle intersects an axis aligned cube? I've done quite a lot of googling, but every resource skips over this part!
In the following image, all the vertices of the triangle lie outside the cube. However, some parts of the triangle lie within the cube. How to solve this case?
I posted in your other post. that shows an example both in 2d and 3d where no points from either object are inside the other object but are still intersecting. You will have to implement and edge collision detection rather than the more common point collision.
You could do something like the second image which makes the box a set of triangles and splits the triangle into more triangles. Now you can see there is a point intersection, and the more triangles you split it into the more accurate it is. In the second image you can clearly see compared to the first which had no point intersections that now there are 2 points intersecting. Image 2 has a higher polygon count.
The best way to do this is to clip the triangle against the six planes bounding the cube. If there's anything left of the triangle at the end, then it intersects the cube. If everything gets clipped away at any step, then the triangle is completely outside the cube.
here is how i do it.
1. test box with triangles bounding box. if no intersection return 'false'
2. test box agains triangle plane. if no intersection return 'false'
3. perform 3 2d overlap tests in xy, yz, zx planes if no overlap of triangle projection with box projection is found in any plane return 'false'
4. return 'true'
this thing is equivalent to minkowski sum method but can be coded a bit easier.