Overlap of convex polytopes under rigid motion

We present an algorithm to compute a rigid motion that approximately maximizes the volume of the intersection of two convex polytopes and in . For all and for all , our algorithm runs in time with probability . The volume of the intersection guaranteed by the output rigid motion is a -approximation of the optimum, provided that the optimum is at least for some given constant .