Scheduling two irregular polygons

Abstract Let A and B be irregular polygons with m and n vertices ( m ⩾ n ) on some circle line. How should polygon A be moved relative to polygon B in such a way that the maximum (minimum) distance between adjacent vertices on the circle line is minimized (maximized)? O( m log m ) algorithms are given which solve these problems.