User:Subekshya Poudel/Teaching Lesson Plan 23

From ICTED-WIKI
Revision as of 03:55, 9 May 2024 by Subekshya Poudel (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Subject : Computer Graphics

Period: Fourth

Topic: Three Dimensional Graphics

Teaching Item: Visible Surface Detection Methods: Object Space (Depth Sorting) Methods

Level: Bachelor 6th sem

Unit: Five

Time: 50 min

No. of Students: 22

Specific Objective

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

  • understand the concept of visible surface detection in 3D graphics
  • learn about object space (depth sorting) methods for visible surface detection
  • explore different depth sorting algorithms and their characteristics

Teaching Materials

  • Laptop
  • Presentation slide
  • Projector
  • Whiteboard and marker

Teaching Learning Activities

1. I will begin the class by asking students what they know about visible surface.
2. Then define visible surface detection as the process of determining which surfaces are visible from a given viewpoint in a 3D scene
3. Discuss the importance of visible surface detection in 3D graphics rendering.
4. Introduce the concept of object space methods for visible surface detection.
5. Differentiate object space and image space.
6. Explore depth sorting algorithm.
7. Present different depth sorting algorithms, such as the Painter's algorithm and the Depth Buffer (Z-buffer) algorithm.
8. Discuss the principles behind each algorithm and their advantages and limitations.
9. Illustrate each algorithm with examples and diagrams to demonstrate their effectiveness.
10. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed.

Assessment

1. Describe the concept of visible surface detection in 3D graphics.

2. Write an algorithm of depth sorting with diagram.