Given two convex d-polytopes P and Q in R d for d 3, we study the problem of bundling P and Q in a smallest convex container. More precisely, our problem asks to nd a minimum convex set containing and Q that are in contact under translations. For dimension d = 3, we present the rst exact algorithm that runs in O(n 3 ) time, where n denotes the number of vertices of P and Q. Our approach easily extends to any higher dimension d > 3, resulting in the rst exact algorithm.
['Hee-Kap Ahn', 'Sang Won Bae', 'Otfried Cheong', 'Dongwoo Park', 'Chan-Su Shin']
Minimum Convex Container of Two Convex Polytopes under Translations