Vector and raster hidden-surface removal using parallel connected stripes

A list-priority algorithm for the removal of hidden surfaces from a three-dimensional scene is presented. The. general lines of the proposed solution are similar to those of classical list-priority algorithms: determination of depth relations between the faces of the solids of the scenes construction of a priority list, and removal of hidden parts. However, the use of an efficient data structures to represent the faces the solids makes the algorithm interesting. This structure, called Parallel Connected Stripes, allows the algorithm to work on several faces at a time, solve cyclic overlaps, and remove hidden parts efficiently while making low-memory requirements. It also allows the user to obtain both vectorial output -the boundaries of the faces and the holes in the scenes- and a raster output similar to that of a scan-line algorithme, that is, withaut the need, to reconstruct the boundaries of visible faces and holes. In the latter case, the data structure permits the implementation of a single antialiasing technique.