Scribd
Upload
48 views3 pages

12454.modified CHO Theory - Doc (CG) CU

This document outlines the course details for a Computer Graphics course offered at Chitkara University, HP. The course is a 3 credit course taught over 3 lecture hours per week. The course coordinator is Ms. Jaspreet Kaur. The course aims to introduce students to computer graphics and image processing through algorithms and applications. It will cover topics such as 2D and 3D transformations, projections, clipping, rendering and curves. Students will be evaluated through three sessional tests worth 40% and a final exam worth 60% of their grade. The syllabus is divided into sections with varying weightages ranging from 10-35%.

Uploaded by

Swati Jindal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
48 views3 pages

12454.modified CHO Theory - Doc (CG) CU

This document outlines the course details for a Computer Graphics course offered at Chitkara University, HP. The course is a 3 credit course taught over 3 lecture hours per week. The course coordinator is Ms. Jaspreet Kaur. The course aims to introduce students to computer graphics and image processing through algorithms and applications. It will cover topics such as 2D and 3D transformations, projections, clipping, rendering and curves. Students will be evaluated through three sessional tests worth 40% and a final exam worth 60% of their grade. The syllabus is divided into sections with varying weightages ranging from 10-35%.

Uploaded by

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

Institute / School Name

Program Name
Course Code
Course Name
Lecture / Tutorial (per
week)
Course
Coordinator
Name

Chitkara University, HP
BE (CSE)
CSL3403
Computer Graphics
3-0-0

Course Credits

Ms Jaspreet Kaur

1. Scope and Objectives of the Course


1. To introduce the necessary background, the basic algorithms, and the applications
of computer graphics and image processing
2. A large proportion of the course considers the design and optimisation of
algorithms, so can be considered a practical application of the lessons learnt in the
Algorithms course.
2. Textbooks
TB1: Computer Graphics by D. Hearn & M.P. Baker, PHI New Delhi, 2nd edition.
TB2: Computer Graphics by Schaums outlines,2nd edition.

3. Other readings and relevant websites


S.No
.

Link of Journals, Magazines, websites and Research Papers


1. http://www.cs.washington.edu/education/courses
2. www.journals.elsevier.com/computers-and-graphics/

4. Course Plan
Lecture Topics
Number

1-2

Introduction:
Introduction to computer graphics, Applications- Computer Aided Design, Digital
Image Processing , Graphical User Interface, Graphics using C:Initgraph,
closegraph, cleardevice, outtextxy, putpixel, getpixel, setcolor.

3-4

To draw line, circle, ellipse, rectangle, polygon, Video Display Devices: Refresh
Cathode-Ray Tubes, Raster Scan Displays, Random Scan Displays. Color CRT
Monitors, Direct-View Storage Tubes.
Flat-Panel Displays- Plasma panels, Liquid Crystal Displays.
Scan Conversion: Scan converting a point, scan converting a Line- Direct use of
the line equation, DDA algorithm, Bresenhams line algorithm.
Scan converting a Circle : Bresenhams Circle algorithm, Midpoint circle
algorithm

5
6-7
8-9
10

Scan Converting a Character : Aliasing effects , Anti- aliasing.

11-12
13-16

Region Filling : Boundary fill algorithm, Flood fill Algorithm.


Two Dimensional Transformations- Geometric Transformations- Translation,
Rotation , Scaling.Coordinate Transformations- Translation, Rotation, Scaling.

17

Two
Dimensional
Transformations-Other
TransformationReflection.Composite transformations.
Coordinate Transformations- Translation, Rotation, Scaling.

Sharing

and

Page 1 of 3

18

Three
Dimensional
Transformations-Geometric
TransformationsTranslation,Rotation , Scaling.
ST-I (Syllabus covered from 1-18 lectures)
19-21
Three Dimensional Transformations- Coordinate Transformations- Translation,
Rotation, Scaling. Other Transformation- Sharing and Reflection.Composite
transformations.
22-23
24-25
26-28
29-31
32-33
34-36

5.

Point Clipping.Line Clipping Cohen- Sutherland Algorithm.


Polygon Clipping-Sutherland-Hodgernan Polygon,Clipping,Other Polygon-Clipping
Algorithms, Curve Clipping, Text Clipping.
Projections: Taxonomy of projection, Perspective Projection- 1 point, 2 point, 3
point. Perspective anomalies. Parallel Projection- Orthographic , multiview ,
axonometric, isometric, diametric , trimetric , Oblique ,cavalier, cabinet.
Hidden line & Surface elimination algorithms: Depth Comparisons, Z-Buffer
Algorithm.
Curved Lines and Surfaces: Bezier Curves and Surfaces, Bezier Curves,
Properties of Bezier Curves..
Surface and Polygon Rendering Methods: Surface-Rendering Methods, PolygonRendering Methods, Constant-Intensity Shading.
ST-II (Syllabus covered from 19-36 lectures)
ST-III (Syllabus covered from 1-36 lectures)

Evaluation Scheme:

Component 2*
Component
3**

Sessional Tests (STs)*


End Term Examination**

40
60

Total

100

* There are three Sessional Tests (STs) for all theory papers. The average of best two will
be considered.
** The End Term Comprehensive examination will be held at the end of semester. The
mandatory requirement of 75% attendance in all theory classes is to be met for being
eligible to appear in this component.
6.

Syllabus with weightage

Contents

Lectures

Introduction:
Introduction to computer graphics, Applications- Computer Aided
Design, Digital Image Processing , Graphical User Interface,
Graphics
using
C:Initgraph,
closegraph,
cleardevice,
outtextxy, putpixel, getpixel, setcolor. To draw line, circle,
ellipse, rectangle, polygon, Video Display Devices: Refresh
Cathode-Ray Tubes, Raster Scan Displays, Random Scan
Displays. Color CRT Monitors, Direct-View Storage Tubes.
Flat-Panel Displays- Plasma panels, Liquid Crystal Displays. Scan
Conversion: Scan converting a point, scan converting a Line- Direct
use of the line equation, DDA algorithm, Bresenhams line
algorithm.
Scan converting a Circle : Bresenhams Circle algorithm, Midpoint
circle algorithm.
Scan Converting a Character : Aliasing effects , Anti- aliasing.

Weighta
ge

35%
3

Page 2 of 3

Region Filling : Boundary fill algorithm, Flood fill Algorithm.


Two Dimensional Transformations- Geometric TransformationsTranslation,
Rotation
,
Scaling
,
Reflection
,Coordinate
Transformations- Translation, Rotation, Scaling , Reflection.
Three Dimensional Transformations-Geometric TransformationsTranslation,Rotation , Scaling. Three Dimensional TransformationsCoordinate Transformations- Translation, Rotation, Scaling. Other
Transformation- Sharing and Reflection.Composite transformations.

Point Clipping.Line Clipping Cohen- Sutherland Algorithm. Polygon


Clipping-Sutherland-Hodgernan Polygon,Clipping,Other PolygonClipping Algorithms, Curve Clipping, Text Clipping.
Projections: Taxonomy of projection, Perspective Projection- 1 point,
2 point, 3 point. Perspective anomalies. Parallel ProjectionOrthographic , multiview , axonometric, isometric, diametric ,
trimetric , Oblique ,cavalier, cabinet. Hidden line & Surface
elimination algorithms: Depth Comparisons, Z-Buffer Algorithm.
Curved Lines and Surfaces: Bezier Curves and Surfaces, Bezier
Curves, Properties of Bezier Curves..

Surface and Polygon Rendering Methods: Surface-Rendering


Methods, Polygon-Rendering Methods, Constant-Intensity Shading

25%
4

30%

2
10%

This Document is approved by:


Designation
Course Coordinator
HOD
Dean Academics
Date

Name
Ms Jaspreet Kaur
Mr Sushil Kumar Bansal
Dr Rajnish Sharma
July 29, 2014

Signature

Page 3 of 3

You might also like