Computer Graphics
Course Objectives:
To familiarize with graphics hardware, line and curve drawing techniques, techniques for representing and manipulating geometric objects, illumination and lighting models. .
 Introduction and application [2 hours]
History of computer graphics, Applications of computer graphics, Hardware: RasterScan Displays, Vector Displays, Hard copy devices, Input Hardwares, Display Architectures, Applications in various fields like medicine, engineering, art, uses in virtual realism.
 ScanConversion [6 hours]
 ScanConverting A Point
 ScanConverting A Straight Line: DDA Line Algorithm, Bresenham's Line Algorithm
 ScanConverting a Circle and an Ellipse: MidPoint Circle and Ellipse Algorithm
 Two –Dimensional Transformations [6 hours]
 Two –dimensional translation, rotation, scaling, reflection, shear transforms
 Twodimensional composite transformation
 Twodimensional viewing pipeline, world to screen viewing transformations and clipping (CohenSutherland Line Clipping, LiangBarsky Line Clipping)
 ThreeDimensional Graphics [6 hours]
 Three –dimensional translation, rotation, scaling, reflection, shear transforms
 Threedimensional composite transformation
 Threedimensional viewing pipeline, world to screen viewing transformation, projection concepts (orthographic, parallel, perspective projections)
 Curve Modeling [4 hours]
Introduction to Parametric cubic Curves, Splines, Bezier curves
 Surface modeling [4 hours]
Polygon surface, vertex table, edge table, polygon table, surface normal and spatial orientation of surfaces
 Visible Surface Determination [6 hours]
 Image Space and Object Space techniques
 Back Face Detection, ZBuffer, ABuffer, ScanLine method
 Illumination and Surface Rendering methods [8 hours]
 Algorithms to simulate ambient, diffuse and specular reflections
 Constant , Gouraud and phong shading models
 Introduction to Open GL [3 hours]
Introduction to OpenGl, callback functions, Color commands, drawing pixels, lines, and polygons using OpenGL, Viewing, Lighting.
Practical:
There shall be 5 to 6 lab exercise including following concepts:
 DDA Line Algorithm
 Bresenham’s Line algorithm
 Mid Point Circle Algorithm
 Mid Point Ellipse Algorithm
 Lab on 2D Transformations
 Basic Drawing Techniques in OpenGL
Text Book:
Donald Hearn and M. Pauline Baker, “Computer Graphics C version (2nd edition)”
Reference
 Donald D. Hearn and M. Pauline Baker, “Computer Graphics with OpenGL (3rd Edition)”
 Foley, Van Dam, Feiner, Hughes “Computer Graphics Principles and Practice (Second Edition in C”)
Evaluation Scheme:
The question will cover all the chapters of the syllabus. The evaluation scheme will be as indicated in the table below:
Chapter 
Hours 
Mark Distribution* 
1 
2 
4 
2 
6 
10 
3 
6 
10 
4 
6 
10 
5 
4 
8 
6 
4 
8 
7 
6 
10 
8 
8 
14 
9 
3 
6 
Total 
45 
80 
*Note: There may be minor deviation in marks distribution.
