We present an algorithm to compute an approximate overlap of two convex polytopes P1 and P2 in R3 under rigid motion. Given any ε ∈ (0, 1/2], our algorithm runs in O(ε−3n log3.5 n) time with probability 1− n−O(1) and returns a (1− ε)-approximate maximum overlap, provided that the maximum overlap is at least λ ·max{|P1|, |P2|} for some given constant λ ∈ (0, 1]. 1998 ACM Subject Classification F...
