CSU540 Sample Problems


      (Sutherland-Hodgeman Polygon Clipping)

Show the effects of the Sutherland-Hodgeman clipping algorithm as applied to the polygon ABCDEFGH relative to the window below. Clip in the order LEFT, TOP, RIGHT, BOTTOM and give the list of vertices after each side is processed. Label the new vertices on the picture and show the final, filled polygon by coloring the appropriate regions and stray edges.


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/PolyClippingProblem.html