A fast hidden-line removal algorithm for single convex or concave object, and multiple objects has been developed. It is applicable to both solid objects constructed with planar faces, and with curved surfaces which are represented by meshes. The invisible lines are removed in phases and the computing time in all phases is minimized. Line edges and plane elements involved in the solid object are sorted in the order of their coordinate values. Bounding rectangular boxes are used to determine the overlaps. In place of the trigonometric functions, a simplified linear function is adopted for reducing the computing time. Illustrative examples are presented to demonstrate the practical applications of the developed algorithm.

This content is only available via PDF.
You do not currently have access to this content.