Entrance Announcement
MICTE 2080
2080 Magh 07
User:Shila Regmi/Teaching Lesson Plan 14: Difference between revisions
Shila Regmi (talk | contribs) Created page with "<div style="column-count: 2; column-gap: 20px;"> '''Subject :''' Computer Graphics '''Period:''' Fourth '''Topic:''' '''Teaching Item:''' '''Class:''' BICTE 6th Semester '''Unit:''' '''Time:''' 50min '''No. of Students:''' </div> == Specific Objectives: == == Instruction Materials: == Daily usages materials. PowerPoint slide. Multimedia Projector Laptop == Teaching Learning Activities == I will start the lesson by ask..." |
Shila Regmi (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
<div style="column-count: 2; column-gap: 20px;"> | <div style="column-count: 2; column-gap: 20px;"> | ||
'''Subject :''' Computer Graphics | '''Subject:''' Computer Graphics | ||
'''Period:''' Fourth | '''Period:''' Fourth | ||
'''Topic:''' | '''Topic:''' Clipping | ||
'''Teaching Item:''' | '''Teaching Item:''' Polygon Clipping | ||
'''Class:''' BICTE 6th Semester | '''Class:''' BICTE 6th Semester | ||
'''Unit:''' | '''Unit:''' Four | ||
'''Time:''' 50min | '''Time:''' 50min | ||
'''No. of Students:''' | '''No. of Students:''' 17 | ||
</div> | </div> | ||
== Specific Objectives: == | == Specific Objectives: == | ||
At the end of this lesson, studemts will be able to: | |||
* understand the concept of polygon clipping | |||
* implement the Sutherland-Hodgman algorithm to clip polygons against a rectangular clipping window. | |||
== Instruction Materials: == | == Instruction Materials: == | ||
| Line 32: | Line 34: | ||
== Teaching Learning Activities == | == Teaching Learning Activities == | ||
I will | I will begin class by introducing the concept of polygon clipping. Explaining that polygon clipping is the process of removing parts of polygons that lie outside a specified region. | ||
I will introduce the Sutherland-Hodgman polygon clipping algorithm, highlighting its key components and steps. | |||
I will ask | I will break down the algorithm into smaller parts, explaining each step in detail. | ||
At last, i will discuss the concept of the intersection of a polygon edge with the clipping window and how it affects the clipped polygon. | |||
I will ask students if they have any confusion related to today topic and at last i will summarize the lesson in brief. | |||
== Assessment == | == Assessment == | ||
* What is polygon clipping, and why is it important in computer graphics? | |||
* Explain the concept of a clipping window in polygon clipping algorithms. | |||
== Evaluation == | == Evaluation == | ||
* Describe the Sutherland-Hodgman polygon clipping algorithm. What are its key steps? | |||
* How does the Sutherland-Hodgman algorithm handle concave and convex polygons differently? | |||
Latest revision as of 03:34, 27 April 2024
Subject: Computer Graphics
Period: Fourth
Topic: Clipping
Teaching Item: Polygon Clipping
Class: BICTE 6th Semester
Unit: Four
Time: 50min
No. of Students: 17
Specific Objectives:
At the end of this lesson, studemts will be able to:
- understand the concept of polygon clipping
- implement the Sutherland-Hodgman algorithm to clip polygons against a rectangular clipping window.
Instruction Materials:
Daily usages materials.
PowerPoint slide.
Multimedia Projector
Laptop
Teaching Learning Activities
I will begin class by introducing the concept of polygon clipping. Explaining that polygon clipping is the process of removing parts of polygons that lie outside a specified region.
I will introduce the Sutherland-Hodgman polygon clipping algorithm, highlighting its key components and steps.
I will break down the algorithm into smaller parts, explaining each step in detail.
At last, i will discuss the concept of the intersection of a polygon edge with the clipping window and how it affects the clipped polygon.
I will ask students if they have any confusion related to today topic and at last i will summarize the lesson in brief.
Assessment
- What is polygon clipping, and why is it important in computer graphics?
- Explain the concept of a clipping window in polygon clipping algorithms.
Evaluation
- Describe the Sutherland-Hodgman polygon clipping algorithm. What are its key steps?
- How does the Sutherland-Hodgman algorithm handle concave and convex polygons differently?