Scribd
Upload
6 views

cg syllabus

Uploaded by

KASHISH MADAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

cg syllabus

Uploaded by

KASHISH MADAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

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.

Practical

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

64

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.


References

1. Baker, D.H. (2008). Computer Graphics. 2nd edition. Prentice Hall of India.

2. 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:

1. Bhattacharya, S. (2018). Computer Graphics. Oxford University Press

2. Cohen, D. I. A. (2011). Introduction to Computer Theory. 2nd edition. Wiley India.

3. Marschner, S., & Shirley, P. (2017) Fundamentals of Computer Graphics. 4th edition. CRC

Press

4. Rogers, D. F. (1989). Mathematical Elements for Computer Graphics. 2nd edition. McGraw

Hill.

Course Teaching Learning Process

● Use of ICT tools in conjunction with traditional class room teaching methods

● Interactive sessions

● Class discussions

Tentative weekly teaching plan is as follows:

65

Week Contents

1 Introduction to Graphics systems, Basic elements of Computer graphics, Applications

of computer graphics.

2 Graphics Hardware: Architecture of Raster and Random scan display devices,

input/output devices.

3-4 Drawing Primitives: Raster scan line drawing algorithm, circle and ellipse drawing

algorithms

5 Polygon filling, line clipping and polygon clipping algorithms

6 Transformation: 2D and 3D Geometric Transformations

7-9 Viewing : 3D Viewing Transformations, Parallel Projections, Perspective

Projections ,Vanishing points

10 Geometric Modeling: Representing curves(Hermite and Bezier)

11-12 Geometric Modeling: Representing curves(Hermite and Bezier)(cont.), Visible


Surface determination: Z-buffer algorithm

13 List-priority algorithm and area subdivision algorithm.

14 Surface rendering: Illumination and shading models

15 RGB color model and Computer Animation.

Assessment Methods

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

Keywords

Computer Graphics, Modelling, Rendering, Transformation and viewing

You might also like