A Lab Exercise for 2D Line Clipping
Authors:
David StahlUS Naval Academy
CGEMS Best Material
Line clipping is a fundamental topic in an introductory graphics course. The simplicity and elegance of the classic Cohen-Sutherland 2D Line Clipping Algorithm makes it suitable for implementation by the student in a lab exercise. An understanding of the algorithm is reinforced by having students write actual code and see the results. A code framework is provided that allows an instructor to focus student effort on the algorithm while avoiding the details of the visualization API used to render the results.
Submission type: Problem Sets
Published at: 9/7/2007
License: Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License.
Download (679,9 KB)

Categories: Algorithmic
Keywords: 2D and 3D modeling, Algorithm development, Rendering
Other Keywords: [None Given]

Requirements: OpenGL/GLUT3.7 c++ compiler
Intended Audience: Undergraduate introductory computer graphics
Prerequisites: Algebra and trigonometry