Hidden line elimination for isooriented rectangles

Abstract

We consider a special case of the hidden line elimination problem. The scene consists of n isooriented rectangles in R^{3} and an observer at z=+\infty. We give an algorithm that computes the visible parts of the edges on a random access machine in time O(n\log n+k\log\frac{n^{2}}{k}), where k is the number of line segments in the output, and uses O(nlog n) space.