We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding the minimum-norm point in a polytope.
