Entrance Announcement
MICTE 2080
2080 Magh 07
User:Subekshya Poudel/Teaching Lesson Plan 21: Difference between revisions
(Created page with "<div style="column-count: 2; column-gap: 20px;"> '''Subject :''' Computer Graphics '''Period:''' Fourth '''Topic:''' Three Dimensional Graphics '''Teaching Item:''' 3D object representation: Polygon table '''Level:''' Bachelor 6<sup>th</sup> sem '''Unit:''' Five '''Time:''' 50 min '''No. of Students:''' <br> </div> == Specific Objective == At the end of this lesson students will be able to: * understand the concept of polygon cl...") |
|||
| Line 27: | Line 27: | ||
* Laptop | * Laptop | ||
* Presentation slide | * [https://docs.google.com/presentation/d/1NdGb2OEqd0roz2hstPgoBqMW3WXYWUrS/edit#slide=id.p12 Presentation slide] | ||
* Projector | * Projector | ||
* Whiteboard and marker | * Whiteboard and marker | ||
Revision as of 08:22, 7 May 2024
Subject : Computer Graphics
Period: Fourth
Topic: Three Dimensional Graphics
Teaching Item: 3D object representation: Polygon table
Level: Bachelor 6th sem
Unit: Five
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.