User:Subekshya Poudel/Teaching Lesson Plan 20

Subject : Computer Graphics

Period: Fourth

Topic: Clipping

Teaching Item: Polygon clipping: Sutherland-Hodgeman polygon clipping algorithm

Level: Bachelor 6^th sem

Unit: Four

Time: 50 min

No. of Students:

Specific Objective

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

• understand the concept of polygon clipping in computer graphics
• familiarize with the the steps involved in the Sutherland-Hodgeman algorithm
• apply the Sutherland-Hodgeman algorithm to clip polygons against a clipping window

Teaching Materials

• Laptop
• Presentation slide
• Projector
• Whiteboard and marker

Teaching Learning Activities

1. At first I will ask students what they know about polygon clipping.
2. Then define polygon clipping as the process of determining which parts of a polygon lie inside or outside a specified region.
3. Discuss the importance of polygon clipping in various graphics applications.
4. Introduce Sutherland-Hodgman algorithm and its relevance in rendering scenes.
5. Present the steps involved in the Sutherland-Hodgeman polygon clipping algorithm.
6. Discuss each step, including the intersection calculations and output polygon generation.
7. Illustrate the algorithm with examples and diagrams to demonstrate its effectiveness.
8. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed.

Assessment

1. Describe the steps involved in the Sutherland-Hodgman polygon clipping algorithm and how it can be applied to clip polygons against a clipping window.