# Can I test for containment of convex polyhedra with the separating axis theorem?

I would like to refine the output of the separating axis test to not only tell me whether convex polyhedron A intersects convex polyhedron B, but also whether A is completely inside B. Is it safe to say that if A's corner points' projections (onto the separating axes) are always inside B's corner points' projections, A is inside B?

Also, is this the standard way to do combined intersection + containment tests?

• Right now it looks like the answer to the question would be simply "yes" — which is well below our minimum character count threshold for an answer. ;) Can you point to a problem or bug you've observed in this approach that we can help you correct? If not, what evidence do you have that this might be incorrect? Feb 28, 2020 at 17:01
• Hmm, maybe I'll make it a self-answer then. Feb 28, 2020 at 17:13
• I am definitely interested in comments on whether that is the usual way to do it, or if there is an even simpler approach as well. Feb 28, 2020 at 17:14
• Then it might be good to rephrase your question as "how to check whether one convex polyhedron is completely contained in another?" and post your proposed method as an answer to be voted on. Then others can chime in with alternative solutions. Feb 28, 2020 at 17:29