Issue No. 01 - January (1985 vol. 5)
David Rogers , United States Naval Academy
Linda Rybak , United States Naval Academy
The purpose of this note is to bring to the attention of the computer graphics community a powerful, efficient, general two- and three-dimensional line-clipping algorithm originated by Cyrus and Beck.1 This algorithm appears to be virtually unknown to the computer graphics community. For example, the algorithm is neither referenced nor discussed by Newman and Sproull2 of Foley and van Dam.3 Further, it is not referenced in the current literature in the field. For example, the algorithm was unknown to Liang and Barsky at the time they developed their recent line-and polygon-clipping algorithms.
D. Rogers and L. Rybak, "On an Efficient General Line-Clipping Algorithm," in IEEE Computer Graphics and Applications, vol. 5, no. , pp. 82-86, 1985.