Grade "A+" Accredited by NAAC with a CGPA of 3.46
Grade "A+" Accredited by NAAC with a CGPA of 3.46

Computer Graphics

Course ID
B.Sc. CS (Hons.)
Paper Type
Core Course
Lecture & Practical

Unique Paper Code: Update Awaited

This course introduces fundamental concepts of Computer Graphics with focus on modelling, rendering and interaction aspects of computer graphics. The course emphasizes the basic principles needed to design, use and understand computer graphics system.

Learning Outcomes:

At the end of the course, students should be able to:

  • Describe Standard raster and vector scan devices as well as Graphical Input and output devices.
  • Implement algorithms for drawing basic primitives such as linecircle and ellipse.
  • Implement algorithms for line clipping and polygon clipping and filling.
  • Implement a 3D object representation scheme and carryout 2D and 3D Transformation, 3D projections.
  • Implement visible surface determination algorithms, Illumination models and surface rendering methods, color models.
  • Implement a simple computer animation algorithm.

Course Contents

Unit 1
Unit 2
Unit 3
Unit 4
Unit 5

Unit 1

Introduction: Introduction to Graphics systems, Basic elements of Computer graphics, Applications of computer graphics. Architecture of Raster and Random scan display devices, input/output devices.

Unit 2

Drawing and clipping primitives: Raster scan line, circle and ellipse drawing algorithms, Polygon filling, line clipping and polygon clipping algorithms.

Unit 3

Transformation and Viewing: 2D and 3D Geometric Transformations, 2D and 3D Viewing Transformations (Projections- Parallel and Perspective), Vanishing points.

Unit 4

Geometric Modeling: Polygon Mesh Representation, Cubic Polynomial curves (Hermite and Bezier).

Unit 5

Visible Surface determination and Surface Rendering: Z-buffer algorithm, List-priority algorithm and area subdivision algorithm for visible surface determination. Illumination and shading models, RGB color model and Basics of Computer Animation.


Lab List 1

  1. Write a program to implement Bresenham’s line drawing algorithm.
  2. Write a program to implement mid-point circle drawing algorithm.
  3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm.
  4. Write a program to clip a polygon using Sutherland Hodgeman algorithm.
  5. Write a program to fill a polygon using Scan line fill algorithm.
  6. Write a program to apply various 2D transformations on a 2D object (use homogenous Coordinates).
  7. Write a program to apply various 3D transformations on a 3D object and then apply parallel and perspective projection on it.
  8. Write a program to draw Hermite /Bezier curve.

Additional Information

Text Books

Baker, D.H. (2008). Computer Graphics. 2nd edition. Prentice Hall of India.
Foley, J. D., Dam, A.V, Feiner, S. K., & Hughes, J. F. (1995). Computer Graphics: Principles and Practice in C. 2nd edition. Addison-Wesley Professional.

Additional Resources

Bhattacharya, S. (2018). Computer Graphics. Oxford University Press
Cohen, D. I. A. (2011). Introduction to Computer Theory. 2nd edition. Wiley India.
Marschner, S., & Shirley, P. (2017) Fundamentals of Computer Graphics. 4th edition. CRC Press
Rogers, D. F. (1989). Mathematical Elements for Computer Graphics. 2nd edition. McGraw Hill.

Teaching Learning Process

Use of ICT tools in conjunction with traditional class room teaching methods
Interactive sessions
Class discussions

Assessment Methods

Written tests, assignments, quizzes, presentations as announced by the instructor in the class


Computer Graphics, Modelling, Rendering, Transformation and viewing.

Disclaimer: Details on this page are subject to change as per University of Delhi guidelines. For latest update in this regard please refer to the University of Delhi website here.

English English हिन्दी हिन्दी