Given two corresponding sets of points, the problem is to find
the best movement, translation and rotation, of a set to the
other set so that the
maximum distance between the corresponding pairs of points may be
minimized. Using the dynamic Voronoi diagrams, efficient
algorithms are given.