User:Subekshya Poudel/Teaching Lesson Plan 21: Difference between revisions

Line 20: Line 20:
At the end of this lesson students will be able to:
At the end of this lesson students will be able to:


* understand the concept of polygon clipping in computer graphics
* understand the concept of polygon surface
* familiarize with the the steps involved in the Sutherland-Hodgeman algorithm
* learn about the structure and organization of polygon tables.
* apply the Sutherland-Hodgeman algorithm to clip polygons against a clipping window
* understand about polygon meshes with its advantage and disadvantage


== Teaching Materials ==
== Teaching Materials ==