Computation of interferences between three-dimensional objects and the optimal packing problem

Abstract

The related problems of computing the separation/interference distance between two three-dimensional objects and clearance/protrusion distance between an object and a container wall occur frequently in industry. A method for computing these distances by solving appropriate optimization problems is presented. The method can treat three-dimensional objects with curved sides. The problem of optimally packing objects into a container is also discussed. The packing problem is also solved as an optimization problem The separation/interference and clearance/protrusion problems become subproblems to the packing problem. Examples are presented in the paper.