The title says it all, given two convex patches, how to find points/faces that have distance < x?  Can I use GJK for this case?Convex patches are obtained from convex decomposition, see here. If I read it correctly, I don't think methods used in that paper can give points/faces that satisfy above condition.
Given two convex patches, how to find points/faces that have distance < x?
computational geometry