Cuboid inside generic polyhedron

Posted by DOFHandler on Stack Overflow See other posts from Stack Overflow or by DOFHandler
Published on 2014-06-12T09:27:02Z Indexed on 2014/06/12 15:25 UTC
Read the original article Hit count: 191

I am searching for an efficient algorithm to find if a cuboid is completely inside or completely outside or (not-inside and not-outside) a generic (concave or convex) polyhedron. The polyhedron is defined by a list of 3D points and a list of facets. Each facet is defined by the subset of the contour points ordinated such as the right-hand normal points outward the solid.

Any suggestion?

Thank you

© Stack Overflow or respective owner

Related posts about Performance

Related posts about algorithm