Maximum Overlap of Convex Polytopes under Translation

We study the problem of maximizing the overlap of two convex polytopes under translation in R-d for some constant d >= 3. Let 11 be the number of bounding hyperplanes of the polytopes. We present an algorithm that, for any epsilon > 0, finds an overlap at least the optimum minus E and reports a translation realizing it. The running time is O(n(left perpendiculard/2right perpendicular+1)log(d)n) with probability at least 1 - n(-O(1)), which can be improved to O(n log(3.5) n) in R-3. The time complexity analysis depends on a bounded incidence condition that we enforce with probability one by randomly perturbing the input polytopes. This causes an additive error e, which can be made arbitrarily small by decreasing the perturbation magnitude. Our algorithm in fact computes the maximum overlap of the perturbed polytopes. All bounds and their big-O constants are independent of E.1