University of Mumbai

Class: S.E. Branch: Computer Engineering Semester: IV

Subject: Computer Graphics (Abbreviated as C.G.)

Periods per Week Lecture 04
(each 60 min) Practical 02
Tutorial --
Hours Marks
Evaluation System Theory 03 100
Practical and Oral 02 25
Oral --- --
Term Work --- 25
Total 05 150
Module Contents Hours
1 Basic concepts 06
1. Introduction to computer graphics
2. lines, line segments, vectors, pixels and frame buffers,
vector generation
3. DDA and Bresenham line drawing algorithms.
4. Mid point and Bresenham’s circle drawing algorithms
5. mid point ellipse drawing algorithm,
6. various styles of lines like thick lines,
7. character generation methods
 Stroke Principle,
 Bit map method
8. Display file structureDisplay file interpreter,
2 Polygons 10
1. Introduction,
2. representation of polygon
3. entering Polygons in display file,
4. inside-outside test
5. Polygon filling methods
 Boundary fill ,
 Flood fill
 scan line Polygon Fill
 Patterns filling.
Transformations
1. homogeneous coordinates
2. Translation
3. Scaling
4. Rotation
5. Rotation about an arbitrary point
6. inverse transforms
7. shear transforms
8. Reflections.
3
Segments 08
1. Introduction
2. segment table
3. Operations segment
 Creation
 Closing
 Deletion
 renaming,
 Visibility
4. other display-file structures
5. Image transformations
6. raster techniques.
Windowing and clipping
1. Introduction
 2. viewing transforms
3. 2D line clipping
 Cohen-Sutherland line clipping
 Midpoint subdivision algorithm
 Liang-Barsky Line Clipping algorithm,
 Cyrus-Beck algorithm
4. Text Clipping
5. Polygon Clipping
 Sutherland-Hodgman polygon clipping algorithm
 Weiler-Arthorton polygon clipping
 Liang barsky polygon clipping
6. Generalized clipping.
4 3-D Transformations 08
1. Introduction
2. 3-D geometry
3. 3-D display methods
4. 3-D object representation methods
5. 3-D transformations
6. Rotation about an arbitrary axis
7. Concept of parallel and perspective projections
8. 3-D clipping
9. 3-D viewing transformations
5 Hidden Surfaces and Lines 08
1. Introduction
2. Back-face removal algorithm
3. Z buffers
4. scan-line
5. Painter’s algorithm
6. Warnock’s algorithm
7. hidden line methods.
Light, Color and Shading
1. Introduction
2. Diffuse illumination
3. Point-source illumination
4. Specular reflection
5. shading algorithms
6. transparency
7. reflections
8. shadows
9. ray tracing
10. Colour models
11. rendering pipeline.

6 Curves and fractals 08

1. Introduction
2. Curve generation
 B-Splines
 Bezier curves
3. Surfaces
 Bezier Surfaces
 B spline Surfaces
4. Fractals, fractal lines and surfaces.
Animation
1. Devices for producing animation
2. Computer assisted animation
3. real time animation
4. frame-by-frame animation
5. method for controlling animation (fully explicit control,
procedural)

Term Work –
1. Journal should consist of at least 10 Experiments based on above syllabus.

2. One written test should be conducted in the semester for the weight age of 10 Marks.

3. Suggested list of Experiments based on which practical examination should be

Conducted:
1.DDA / Bresenham’s line algorithm with various styles like thick, dotted etc.
( Make use of Display File concept.)
2.Circle drawing using Bresenham’s or Midpoint Algorithm.
3.Various 2D transformations ( Scaling, Rotation,Translation etc. )
implementation . Use matrices multiplications for implementation.
4.Various Polygon Filling Methods like Pattern fill , Flood fill , Boundary fill.
5.2D Curves and surfaces drawing like Bezier , B Spline.
6.Line clipping - Liang Barsky , cohen – Sutherland
7.Polygon clipping -Sutherland Hodgman.
8.3D transformations
9.Fractals
10.Character Generation.
Implementation of these experiments can be done in c/c++/java.
Practical exam of 25 marks should be based on this list of experiments.

4. Mini. Projects: journal should include 2 Mini projects as a part of term work
(Mini project is not part of practical exam ).
(Concerned staff should form group of at most 3 students.)
Suggested mini project topics are
a. Graphics editor.
b. displaying given 3D object using perspective projection
c. 3D modeling of objects using OpenGL.
d. Implementing any shading algorithms using OpenGL.
e. Surface rendering using OpenGL.

5. Journal should also have at least 3 assignments based on above syllabus

Text Books

1. S. Harrington, “Computer Graphics”, 2nd Edition, McGraw-Hill Publications, 1987

ISBN 0 – 07 – 100472 – 6
2. J. Foley, Van Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and Practice”,
2nd Edition, Pearson Education, 2003, ISBN 81 – 7808 – 038 – 9
3. Leen Ammeraal ,KangZRang “Computer Graphics for Java Programming 2nd ed
Wiley India

Reference Books
1. D. Rogers, “Procedural Elements for Computer Graphics”, 2nd Edition, TATA
Mc-Graw-Hill Publication, 2001, ISBN 0 – 07 – 047371 - 4
2. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson
Education, 2002, ISBN 81 – 7808 – 794 – 4
3. F. Hill, “Computer Graphics: Using OpenGL”, 2nd Edition, Pearson Education,
2003 ISBN 81 – 297 – 0181 – 2
4. Xiang, Plastock, “Computer Graphics”, 2nd Edition, TATA Mc-Graw-Hill
Publication, 2002, ISBN-0-07-049958-6