Entrance Announcement
MICTE 2080
2080 Magh 07
User:Subekshya Poudel/Teaching Lesson Plan 19: Difference between revisions
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
'''Topic:''' Clipping | '''Topic:''' Clipping | ||
'''Teaching Item:''' Line clipping | '''Teaching Item:''' Line clipping: Cohen-Sutherland line clipping algorithm | ||
'''Level:''' Bachelor 6<sup>th</sup> sem | '''Level:''' Bachelor 6<sup>th</sup> sem | ||
| Line 15: | Line 15: | ||
'''No. of Students:''' | '''No. of Students:''' | ||
<br> | 20<br> | ||
</div> | </div> | ||
== Specific Objective == | == Specific Objective == | ||
| Line 40: | Line 40: | ||
6. Discuss the principles behind Cohen-Sutherland line clipping algorithm with their specific applications.<br> | 6. Discuss the principles behind Cohen-Sutherland line clipping algorithm with their specific applications.<br> | ||
7. Illustrate the algorithm with examples and diagrams to demonstrate their effectiveness.<br> | 7. Illustrate the algorithm with examples and diagrams to demonstrate their effectiveness.<br> | ||
8. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed. | |||
== Assessment == | == Assessment == | ||
| Line 46: | Line 46: | ||
1. Explain the concept of line clipping and discuss its significance in computer graphics. | 1. Explain the concept of line clipping and discuss its significance in computer graphics. | ||
2. Write an algorithm | 2. Write an algorithm for Cohen-Sutherland line clipping. | ||
Latest revision as of 03:52, 9 May 2024
Subject : Computer Graphics
Period: Fourth
Topic: Clipping
Teaching Item: Line clipping: Cohen-Sutherland line clipping algorithm
Level: Bachelor 6th sem
Unit: Four
Time: 50 min
No. of Students:
20
Specific Objective
At the end of this lesson students will be able to:
- understand the concept of line clipping in computer graphics
- familiarize with the principles of Cohen-Sutherland line clipping algorithm
- apply line clipping algorithms to remove lines outside a defined region
Teaching Materials
- Laptop
- Presentation slide
- Projector
- Whiteboard and marker
Teaching Learning Activities
1. At first I will ask students what they know about line clipping.
2. Then define line clipping as the process of determining which parts of a line lie inside or outside a specified region.
3. Discuss the importance of line clipping in various graphics applications.
4. Introduce basic line clipping techniques and their relevance in rendering scenes.
5. Present line clipping algorithms; Cohen-Sutherland algorithms.
6. Discuss the principles behind Cohen-Sutherland line clipping algorithm with their specific applications.
7. Illustrate the algorithm with examples and diagrams to demonstrate their effectiveness.
8. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed.
Assessment
1. Explain the concept of line clipping and discuss its significance in computer graphics.
2. Write an algorithm for Cohen-Sutherland line clipping.