B.Sc.

(H) Computer Science VI Semester (LOCF)

Computer Graphics (BHCS14) Discipline Specific Core Course - (DSC)

S.No. Topic Reference Contents Lectures

1 Introduction: [2] Ch 1 3L
Introduction to Graphics Sections 1.1-1.8 (Pages 23-54)
systems, Basic elements of
Computer graphics,
Applications of computer
graphics.
2 Graphics Hardware: [2] Ch 2 5L
Architecture of Raster and Sections 2.1-2.6 (Pages 56-94)
Random scan display devices,
input/output devices.
3 Drawing and Clipping [1] Ch 3 14L
Primitives: Sections 3.2 -3.2.2 (Pages 72-78),
Raster scan line, circle and Section 3.3 (Pages 81-85) (before 2nd order
ellipse drawing algorithms, differences),
Polygon filling, line clipping Section 3.4 (Pages 88-90),
and polygon clipping Sections 3.6 (Pages 92-99),
algorithms Section 3.12-3.12.3 (Pages 111-117),
Section 3.14 (Pages 124-127),
Section 3.17-3.17.3 (Pages 132-137)
4 Transformations and [3] Ch 2 16L
Viewing: Sections 2.1-2.21 (Pages 61-99)
2D and 3D Geometric Ch 3
Transformations, 2D and 3D Sections 3.1-3.17 (Pages 101-184)
Viewing Transformations,
Vanishing points.
5 Geometric Modeling: [1] Ch 11 8L
Polygon Mesh Representation, Section 11.1-11.2.2 (Pages 473-491)
Cubic Polynomial curves
(Hermite and Bezier)
6 Visible Surface [1] Ch 15 6L
determination: Section 15.4-15.5.1 (Pages 668-675),
Z-buffer algorithm, Depth Sort Section 15.7.1 Pages (686-689)
algorithm and Warnock’s
algorithm
7 Surface Rendering: [2] Ch 14 8L
Color Models, Illumination and Sections 14.1-14.2 (Pages 516-531),
shading models, Computer Sections 14.4-14.5 (Pages 536-545),
Animation Ch 15
Sections 15.3-15.7 (Pages 591-597)
Ch 16
Sections 16.1-16.6 (Pages 604-616)
References
1. Computer Graphics: Principles and Practice 2nd Edition in C, James D. Foley, Andries van
Dam, Steven K. Feiner, John F. Hughes, Pearson Education Asia, 1999.
2. Computer Graphics C version (2nd Edition), D.Hearn, M.P. Baker: Pearson Education, 2006.
3. Mathematical Elements for Computer Graphics 2nd Edition, D.F. Rogers, J. A. Adams, Mc
Graw Hill 2nd edition, 2002.

Practical List Based on Computer Graphics

1. Write a program to implement DDA and 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.

R3 - https://archive.org/embed/mathematicalelem00roge
 Bayesian probabilistic inference, Bayesian networks, Dempster-
9
Shafer theory, Introduction to fuzzy sets and fuzzy logic.
Basic reasoning using fuzzy concepts, production rules, Chomsky
10
hierarchy of grammars, context-free grammars.
11 Hill climbing and its variations, best first search.
12 A* algorithm, constraint satisfaction problem, means-end analysis.
Introduction to game playing, min-max procedure, alpha-beta
13
pruning.
Overview of linguistics, Chomsky hierarchy of grammars, parsing
14-15
techniques..

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

Keywords
Artificial Intelligence, Problem Solving, Knowledge Representation, Reasoning, Uncertainty,
Natural Language Processing

Computer Graphics (BHCS14) Discipline Specific Core Course - (DSC)

Credit: 06

Course Objective
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.

Course Learning Outcomes

On successful completion of the course, students will be able to:
1. Describe Standard raster and vector scan devices as well as Graphical Input and output devices
2. Implement algorithms for drawing basic primitives such as linecircle and ellipse.
3. Implement algorithms for line clipping and polygon clipping and filling.

62
4. Implement a 3D object representation scheme and carryout 2D and 3D Transformation, 3D
projections
5. Implement visible surface determination algorithms, Illumination models and surface
rendering methods, color models
6. Implement a simple computer animation algorithm

Detailed Syllabus
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

63
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:

64
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

Data Analysis and Visualization (BHCS15A) Discipline Specific Elective - (DSE)

Credit: 06

Course Objective

65