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(n6) combinatorially different orthographic views and at most O(n9) 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… (More)
DOI: 10.1016/j.comgeo.2003.10.001


3 Figures and Tables

Slides referencing similar topics