The triangle compare method of hidden-line elimination

An original algorithm which solves the classical computer graphics problem of eliminating those lines that should not be visible in a wire-frame model representation of a solid figure is presented. The basis of this Triangle Compare algorithm is that any polygon, regardless of its complexity, can be constructed from a set of triangles. In the Triangle Compare algorithm, once the triangles defining the figure are defined, they are ordered based on the nearness of each triangle to the viewer and stored in a linked list. The nearest triangle are compared to all succeeding triangles. The remaining parts of triangles are synthesized into other triangles and are added in order to the linked list. Subsequent reference triangles are provided by a traversal of the linked list. After the entire list is traversed and each triangle used as a reference, the resulting list is used for a final rendering with hidden lines removed via calligraphic MOVE and DRAW commands.