CS U540 Sample Problems


      (Cohen-Sutherland Line Clipping)

a. If the Cohen-Sutherland Clipping Algorithm is run on the Line PQ and the clipping is done in the order TOP, LEFT, BOTTOM, RIGHT, how many clip boundaries must be investigated and how many changes are made to the endpoints and in what order?

b. What happens if the order is RIGHT, BOTTOM, LEFT, TOP?


Last Updated: May 27, 6:44 p.m. by
Harriet Fell
College of Computer Science, Northeastern University
360 Huntington Avenue #WVH-340,
Boston, MA 02115
Internet: fell@ccs.neu.edu
Phone: (617) 373-2198 / Fax: (617) 373-5121
The URL for this document is: http://www.ccs.neu.edu/home/fell/CSU540/exams/LineClippingProblem.html