Home → Magazine Archive → April 1969 (Vol. 12, No. 4) → An algorithm for hidden line elimination → Abstract

An algorithm for hidden line elimination

By R. Galimberti

Communications of the ACM, Vol. 12 No. 4, Pages 206-211

Save PDF
The algorithm presented causes the elimination of hidden lines in the representation of a perspective view of concave and convex plane-faced objects on the picture plane. All the edges of the objects are considered sequentially, and all planes which hide every point of an edge are found. The computing time increases roughly as the square of the number of edges. The algorithm takes advantage of a reduced number of concave points and automatically recognizes if only one object with no concave points is considered. In this last case, the result is obtained in a much simpler way.

The full text of this article is premium content


No entries found