Please Login To Continue
Sutherland Hodgemen polygon clipping algorithm.
Lesson 23 of 26 • 0 upvotes • 10:33mins
Antim
We will learn the Sutherland Hodgemen polygon clipping algorithm.
(Hindi) Computer Graphics - GATE (CS and IT)
26 lessons • 3h 46m
1
Introduction to Computer Graphics (in Hindi)
11:15mins
2
Raster Scan (in Hindi)
9:59mins
3
Random Scan (in Hindi)
7:14mins
4
Differentiation between Raster and Random Scan (in Hindi)
5:57mins
5
DDA Algorithm (in Hindi)
8:26mins
6
Example of DDA.
7:50mins
7
Mid point Line Drawing Algorithm
12:04mins
8
Example of mid point line drawing algorithm.
9:24mins
9
Mid point circle Drawing Algorithm
11:10mins
10
Example of mid point circle drawing algorithm.
7:50mins
11
Bresenham's circle drawing algorithm
8:53mins
12
Example- Bresenham's circle drawing algorithm.
7:13mins
13
Polygon Filling-> Scan Filling
12:10mins
14
Scan Filling (part-2)
9:28mins
15
Boundary Filling.
6:41mins
16
Flood filling.
7:40mins
17
Windowing, Viewing Transformation, Viewing pipeline.
10:45mins
18
Window to view-port transformation.
5:08mins
19
Example- window to view port transformation.
9:08mins
20
Clipping- Basic
6:49mins
21
Cohen Sutherland line clipping Algorithm.
10:53mins
22
Example -> Cohen Sutherland line clipping algorithm
6:25mins
23
Sutherland Hodgemen polygon clipping algorithm.
10:33mins
24
Example of Sutherland Hodgemen polygon clipping.
9:08mins
25
2D Transformation.
10:17mins
26
Reflection:- Type of transformation.
4:20mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
