Computer Graphics
Revision Before Exam
Estimated Marks : 40
This is revision playlist by Ashish Panta (NSG). If you are just studying this subject before exam, first of all watch this then for more detailed study see other chapters.






- 1Chapter - 1
- 2Chapter - 2
- 3Chapter - 3
- 4Chapter - 4
- 5Chapter - 5
- 6Chapter - 6
Introduction
Estimated Marks : 5
Small theoritical chapter. You will learn terminologies in computer graphics like pixel, aspect ratio etc. Watch in 2x and quickly complete it.








- 1Terminologies
- 2Types
- 3Application
- 4Image Processing vs CG
- 5CRT
- 6Vector Scan
- 7Raster Scan
- 8Raster vs Vector
Scan Algorithm
Estimated Marks : 10
Very important chapter. Sure minimum 10 marks from this chapter. You will learn how to draw line, circle and ellipse in computer using algorithms. This chapter is bit hard (lots of formula to remember). Derivation is not asked in exam, you are asked how you can use X algorithm to draw Y.












- 1Line - DDA
- 2Line - BLA
- 3Circle - Mid Point (Part 1)
- 4Circle - Mid Point (Part 2)
- 5Ellipse - Part 1
- 6Ellipse - Part 2
- 7Ellipse - Part 3
- 8Polygon Intro and Types
- 9Polygon - Odd Even Test
- 10Boundary Fill - Part 1
- 11Boundary Fill - Part 2
- 12Flood Fill
2D Transformation
Estimated Marks : 10
Sure 5 marks (maybe 10 also). This chapter requires some mathematics and you must know about Matrix beforehand. Also a tip, transformation matrix might look different for same transformation and that is due to column wise or row wise matrix representation, so that get confused on that.














- 12D Transformation - Part 1
- 22D Transformation - Part 2
- 3Homogeneous Coordinate
- 4Composite Transformations
- 52D View
- 6Point Clipping
- 7C. S. Algorithm - 1
- 8C. S. Algorithm - 2
- 9L. B. Algorithm - 1
- 10L. B Algorithm - Numerical 1
- 11L. B. Algorithm - Numerical 2
- 12L. B. Algorithm - Numerical 3
- 13Polygon Clipping - Part 1
- 14Polygon Clipping - Part 2
3D Transformation
Estimated Marks : 10
Likely 5 marks but maybe 10 marks also. A bit hard topics in my opinion. It takes some time to fit into head the 3D view pipeline (as it is more complicated than 2D view pipeline). For exam perspective, properly practice 3D transformation. Perspective topics are bit more tough to get your head around first time. Do check your book for perspective projection numericals, I could not find videos on that.







- 13D Transformations
- 2Tranformation Matrices
- 33D View
- 4Projection - Part 1
- 5Projection - Part 2
- 6Projection - Part 3
- 7Projection - Part 4
3D Object Representation
Estimated Marks : 5
A lot of theory and some decently hard numericals. Mainly focus on numerical related to creating Bezier Curve, Hermite Curve, B-Spline Curve equations. 5 marks numerical question is likely to be asked on that. Spline curve (or cubic spline curve ) is for concept, in exam you will likely be asked about Hermite Curve (a variation of cubic spline curve). I have divided the chapter into 2 parts: Theory and Numerical Related to Curve. Quickly skim through theory (maybe a theoritical question is asked in exam) and then cover the curve numericals. Have patience as some numericals might seem hard for the first time.











- 1Theory - Part 1
- 2Theory - Part 2
- 3Curve Representation
- 4Parametric Curve - Detailed
- 5Parametric & Geometric Continuity
- 6Spline Curve - Just concept
- 7Hermite Curve
- 8Bezier Curve
- 9Bezier Curve Numerical
- 10B Spline Concept
- 11B-Spline - Concept + Numerical
Solid Modeling
Estimated Marks : 5
Just watch Ashish video on this chapter. No detailed video available on youtube close to syllabus. Important topics is : Boundary Representation and Space Paritioning Representation

- 1Solid Modeling - One shot
Visible Surface Detection
Estimated Marks : 0
SOON.
Illumination Models
Estimated Marks : 0
SOON.
Virtual Reality
Estimated Marks : 0
SOON.
OpenGL
Estimated Marks : 5
Sometime 5 marks question is asked from this chapter. But I dont recommend to learn entirely new tech for just 5 marks. I will recommend you to rather focus on other chapters.