On the number of views of translates of a cube and related problems

It is known that a general polyhedral scene of complexity n has at most O(n⁶) combinatorially different orthographic views and at most O(n⁹) combinatorially different perspective views, and that these bounds are tight in the worst case. In this paper we show that, for the special case of scenes consisting of a collection of n translates of a cube, these bounds improve to O(n^4+ε) and O(n^6+ε), for any ε>0, respectively. In addition, we present constructions inducing Ω(n⁴) combinatorially different orthographic views and Ω(n⁶) combinatorially different perspective views, thus showing that these bounds are nearly tight in the worst case. Finally, we show how to extend the upper and lower bounds to several classes of related scenes.