Scribd
Upload
44 views2 pages

Computer Graphics Guidelines (LOCF)

This document outlines the topics and schedule for a Computer Graphics course. It includes 8 topics that will be covered across the semester: 1) Introduction to graphics systems, 2) Graphics hardware, 3) Drawing and clipping algorithms, 4) Transformations and viewing, 5) Geometric modeling, 6) Visible surface determination, 7) Surface rendering, and 8) References for further reading. Each topic includes the number of lectures, referenced chapter sections, and key concepts that will be discussed. It also provides a list of 8 practical programming assignments related to computer graphics algorithms and modeling techniques.

Uploaded by

hello world
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views2 pages

Computer Graphics Guidelines (LOCF)

This document outlines the topics and schedule for a Computer Graphics course. It includes 8 topics that will be covered across the semester: 1) Introduction to graphics systems, 2) Graphics hardware, 3) Drawing and clipping algorithms, 4) Transformations and viewing, 5) Geometric modeling, 6) Visible surface determination, 7) Surface rendering, and 8) References for further reading. Each topic includes the number of lectures, referenced chapter sections, and key concepts that will be discussed. It also provides a list of 8 practical programming assignments related to computer graphics algorithms and modeling techniques.

Uploaded by

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

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.

You might also like