On the complexity of the free space of a translating box in R^3

Abstract

Consider a convex polyhedral robot $B$ that can translate (without rotating) amidst a finite set of non-moving polyhedral obstacles in ${\mathbb{R}}^3$. The "free space" $\mathcal{F}$ of $B$ is the set of all positions in which $B$ is disjoint from the interior of every obstacle. Aronov and Sharir (1997) derived an upper bound of $O(n^2\log n)$ for the combinatorial complexity of $\mathcal{F}$, where $n$ is the total number of vertices of the obstacles, and the complexity of $B$ is assumed constant. Halperin and Yap (1993) showed that, if $B$ is either a box or a "flat" convex polygon, then a tighter bound of $O(n^2\alpha (n))$ holds. Here $\alpha (n)$ is the inverse Ackermann function. In this paper we prove that if $B$ is a box, then the complexity of $\mathcal{F}$ is $O(n^2)$. Furthermore, if $B$ is a convex polygon whose edges come in parallel pairs, then the complexity of $\mathcal{F}$ is $O(n^2)$ as well. These results settle the question of the asymptotical worst-case complexity of $\mathcal{F}$ for a box, as well as for all convex polygons.

16 pages, 13 figures