Entrance Announcement
MICTE 2080
2080 Magh 07

Please contact us

User:Subekshya Poudel/Teaching Lesson Plan 23: Difference between revisions

From ICTED-WIKI
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(3 intermediate revisions by the same user not shown)
Line 15: Line 15:


'''No. of Students:'''  
'''No. of Students:'''  
<br>
22<br>
</div>
</div>
== Specific Objective ==
== Specific Objective ==
At the end of this lesson students will be able to:
At the end of this lesson students will be able to:


* understand the concept of projection in 3D graphics
* understand the concept of visible surface detection in 3D graphics
* learn about the types of projection and their characteristics
* learn about object space (depth sorting) methods for visible surface detection
* differentiate parallel projection and perspective projection
* explore different depth sorting algorithms and their characteristics


== Teaching Materials ==
== Teaching Materials ==
Line 33: Line 33:
== Teaching Learning Activities ==
== Teaching Learning Activities ==


1. I will begin the class by describing projection as a fundamental concept in computer graphics that involves the conversion of three-dimensional (3D) objects into a two-dimensional (2D) view plane or screen.<br>
1. I will begin the class by asking students what they know about visible surface.<br>
2. Then categorize its type: Parallel projection and Perspective projection.<br>
2. Then define visible surface detection as the process of determining which surfaces are visible from a given viewpoint in a 3D scene<br>
3. At first I will define parallel projection use to display picture in its true shape and size.<br>
3. Discuss the importance of visible surface detection in 3D graphics rendering.<br>
4. Discuss the types of parallel projection: orthographic projection and oblique projection by illustrating figure in the whiteboard.<br>
4. Introduce the concept of object space methods for visible surface detection.<br>
5. Discuss the how orthographic projections used to produce the front, side, and top views of an object by showing figure from the projector.<br>
5. Differentiate object space and image space.<br>
6. By showing the figures from whiteboard I will define the polygon is a plane figure that is made up of straight line segments connected to form a closed shape.<br>
6. Explore depth sorting algorithm.<br>
7. After parallel projection I will define perspective projection; objects that are farther away from the viewer appear smaller, imparting a sense of depth to the representation.<br>
7. Present different depth sorting algorithms, such as the Painter's algorithm and the Depth Buffer (Z-buffer) algorithm.<br>
8. Discuss about the important two key feature of parallel projection: foreshortening and vanishing point with figure.<br>
8. Discuss the principles behind each algorithm and their advantages and limitations.<br>
9. Then discuss the types of perspective projection with figure: one-point perspective, two-point perspective and three-point perspective.<br>
9. Illustrate each algorithm with examples and diagrams to demonstrate their effectiveness.<br>
10. At last I will ask students to write the difference between parallel projection and perspective projection.<br>
10. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed.
11. Ask students if there is any confusion on today's topic and provide guidance and assistance if needed.


== Assessment ==
== Assessment ==


1. Explain the concept of projection in 3D graphics and discuss the characteristics of parallel and perspective projection.
1. Describe the concept of visible surface detection in 3D graphics.  


2. Illustrate and explain the key components of perspective projection.
2. Write an algorithm of depth sorting with diagram.

Latest revision as of 03:55, 9 May 2024

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.

Retrieved from "https://icted.org.np/index.php?title=User:Subekshya_Poudel/Teaching_Lesson_Plan_23&oldid=6506"