By Topic

On an Efficient General Line-Clipping Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rogers, D.F. ; United States Naval Academy ; Rybak, L.M.

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.

Published in:

Computer Graphics and Applications, IEEE  (Volume:5 ,  Issue: 1 )