COMPUTER SCIENCE AND ENGINEERING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST435 COMPUTER GRAPHICS
OEC 2 1 0 3 2019

Preamble: This course helps the learners to make awareness about strong theoretical concept in
computer graphics. It covers the three-dimensional environment representation in a computer,
transformation of 2D/3D objects and basic mathematical techniques and algorithms used to build
applications. This course enables the learners to develop the ability to create image processing
frameworks for different domains and develop algorithms for emerging display technologies.

Prerequisite: A sound knowledge of Mathematics and concepts of any programming language.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge
CO1 level: Understand)

Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)

CO3 Demonstrate geometric representations and transformations on 2D & 3D objects

(Cognitive Knowledge level: Apply)
CO4 Demonstrate the working of line and polygon clipping algorithms(Cognitive
Knowledge level: Apply)
CO5 Summarize visible surface detection methods and illustrate projection
algorithms. (Cognitive Knowledge level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2

CO3

CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

 COMPUTER SCIENCE AND ENGINEERING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one full
question. Each question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module – 1(Basics of Computer graphics)

S
Basics of Computer Graphics and its applications. Video Display devices- Refresh Cathode Ray
Tubes(CRT), Random Scan Displays and systems, Raster scan displays and systems, Color CRT
displays, Flat panel display and its categories.
Module – 2 (Line drawing, Circle drawing and Filled Area Primitives)
Line drawing algorithms- DDA, Bresenham’s algorithm. Circle drawing algorithms- Midpoint
Circle generation algorithm, Bresenham’s algorithm. Filled Area Primitives- Scan line polygon
filling, Boundary filling and flood filling.
Module - 3 (Geometric transformations)
Two dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing,
Composite transformations, Matrix representations and homogeneous coordinates. Basic 3D
transformations.
Module - 4 (Clipping)
Window to viewport transformation. Cohen Sutherland and Midpoint subdivision line clipping
algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping algorithms.
 COMPUTER SCIENCE AND ENGINEERING

Module - 5 (Three dimensional graphics)

Three dimensional viewing pipeline. Projections- Parallel and Perspective projections. Visible
surface detection algorithms- Back face detection, Depth buffer algorithm, Scan line algorithm, A
buffer algorithm

Text Book
1. Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw
Hill, 2019.
2. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
References
1. William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics.
McGraw Hill, 2001
2. David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
3. Donald Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with
OpenGL, PHI, 4e, 2013

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare the working principle of raster scan systems and random scan systems.
2. How much time is spent scanning across each row of pixels during screen refresh on a
raster system with resolution of 1280*1024 and a refresh rate of 60 frames per second?
Course Outcome 2 (CO2):
1. Rasterize the line using Bresenham’s line drawing algorithm with end points (2,3) and
(5,8) accepted from the user and implement it using any appropriate programming
language. (Assignment)
2. Illustrate how the 4-connected boundary filling approach differs from 8-connected
boundary filling and implement it using any appropriate programming language.
(Assignment)
Course Outcome 3 (CO3):
1. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3) , where
the
position vector of the coordinates is given as A(4,1), B(5,2) and C(4,3).
2. Implement the above transformation using any appropriate programming language with
user inputs. (Assignment)
3. Illustrate the steps required for a general 3D rotation if the rotation axis is not parallel to
any one of the principal axis. The rotation axis is defined by the points P1(x1,y1,z1) and
P2(x2,y2,z2). Give its composite matrix representation.
Course Outcome 4 (CO4):
1. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen
Sutherland algorithm, find the visible portion of the line segment joining the points
P(40,80) and Q(120,30).
 COMPUTER SCIENCE AND ENGINEERING

2. Implement Cohen Sutherland clipping algorithm using any appropriate programming

language with user inputs. (Assignment)
Course Outcome 5 (CO5):
1. Explain scan line algorithm for detecting visible surfaces in an object.
2. Derive the matrix for performing perspective projection and parallel projection.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST435

Course Name: Computer Graphics

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Describe Flat Panel display and its categories.

2. Consider a raster system with a resolution of 1024*1024. Compute the size of the
raster needed to store 4 bits per pixel? How much storage is needed if 8 bits per
pixel are to be stored?

3. Justify the usage of integer arithmetic in Bresenham’s line drawing algorithm.

4. How 8-way symmetry of circle can be used for developing circle drawing
algorithms?

5. Show that two successive reflections about either of the coordinate axes is
equivalent to a single rotation about the coordinate origin.

6. Determine a sequence of basic transformations that is equivalent to x-direction

shearing.

7. Find the window to viewport normalization transformation with window lower left
corner at (1,1) and upper right corner at (2,6).
 COMPUTER SCIENCE AND ENGINEERING

8. How does Cohen Sutherland algorithm determine whether a line is visible, invisible or
a candidate for clipping based on the region codes assigned to the end points of the
line?

9. Define the terms (i) Centre of projection (ii) Principal vanishing point

10. Differentiate between the object space and image space method for the hidden surface
removal of an image. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the working principle of beam penetration method and shadow mask (8)
method with suitable illustrations.

(b) Draw the architecture of raster scan display systems and explain its working (6)
principle.

OR

12. (a) Explain the working principle of a Refresh CRT monitor with suitable (8)
diagrams.

(b) Describe random graphics system with suitable illustrations. (6)

13. (a) Differentiate between boundary fill and flood fill algorithms. (5)

(b) Derive the initial decision parameter of Bresenham’s line drawing algorithm (9)
and rasterize a line with endpoints (2,2) and (10,10).

OR

14. (a) Write Midpoint circle drawing algorithm and identify the points in the circle (8)
with radius as 20 and center at (50,30) using the algorithm.

(b) Illustrate the working principle of scan line polygon filling algorithm. (6)

15. (a) Reflect a triangle ABC about the line 3x-4y+8=0, where the coordinates of the (8)
triangle are given as A(4,1), B(5,2) and C(4,3).

(b) A diamond shaped polygon is located at P(-1,0), Q(0,-2), R(1,0) and S(0,2). (6)
Find the transformation matrix which would rotate the triangle by 90 degree
counter clockwise about the point Q. Using the transformation matrix, find
the coordinates of the rotated polygon.

OR
 COMPUTER SCIENCE AND ENGINEERING

16. (a) Describe the steps required for a general 3D rotation if the rotation axis is not (8)
parallel to any one of the principal axis. The rotation axis is defined by the
points P1(x1,y1,z1) and P2(x2,y2,z2). Give its composite matrix
representation.

(b) Consider a triangle at (2,2), (10,2), (2,10). Perform the following 2D (6)
transformations in succession and find the resultant vertices.
i) Scale with respect to (2,2) by scaling factors (2,2) along x
and y directions.
ii) Rotate by 90 degree counter clockwise direction.
iii) Reflection based on y=x

17. (a) Illustrate Weiler – Atherton polygon clipping algorithm. (6)

(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (8)
line with end points P1 (70, 20) and P2(100,10) against a window with lower
left hand corner (50,10) and upper right hand corner (80,40).

OR

18. (a) Describe Sutherland Hodgeman polygon clipping algorithm and list out its (7)
limitations.

(b) Explain the steps involved in clipping a line using Mid point Subdivision (7)
algorithm.

19. (a) Explain how visible surfaces can be detected using depth buffer algorithm. (7)

(b) Define parallel projection. Describe orthographic and oblique parallel (7)
projection.

OR

20. (a) Illustrate the scan line method used in visible surface detection. (7)

(b) Derive the matrix needed for performing perspective projections. (7)
 COMPUTER SCIENCE AND ENGINEERING

TEACHING PLAN

No of Lecture
No Contents
Hrs (35 hrs)

Module – 1 (Basics of Computer Graphics) (6 hrs)

1.1 Basics of Computer Graphics and applications 1
1.2 Refresh Cathode Ray Tubes 1
1.3 Random Scan Displays and systems 1
1.4 Raster scan displays and systems 1
1.5 Color CRT displays 1
1.6 Flat panel display and its categories. 1
Module - 2 (Line drawing, Circle drawing and Filled Area Primitives) (7 hrs)
2.1 DDA Line drawing Algorithm 1
2.2 Bresenham’s line drawing algorithm 1
2.3 Midpoint Circle generation algorithm 1
2.4 Bresenham’s Circle generation algorithm 1
2.5 Illustration of line drawing and circle drawing algorithms 1
2.6 Scan line polygon filling 1
2.7 Boundary filling and flood filling 1
Module - 3 (Geometric transformations) ( 8 hrs)
3.1 Basic 2D transformations-Translation and Rotation 1
3.2 Basic 2D transformations- Scaling 1
3.3 Reflection and Shearing 1
3.4 Illustration of 2D Transformations 1
3.5 Composite transformations 1
3.6 Matrix representations and homogeneous coordinates 1
3.7 Basic 3D transformations 1
3.8 Illustration of basic 3D transformations 1
Module - 4 (2D Clipping) (6 hrs)
4.1 Window to viewport transformation 1
4.2 Cohen Sutherland Line clipping algorithm 1
4.3 Midpoint subdivision Line clipping algorithm 1
4.4 Sutherland Hodgeman Polygon clipping algorithm 1
4.5 Weiler Atherton Polygon clipping algorithm 1
4.6 Practice problems on Clipping algorithms 1
Module - 5 (Three dimensional graphics)( 8 hrs)

5.1 Three dimensional viewing pipeline, Projections-Parallel 1

projections
 COMPUTER SCIENCE AND ENGINEERING

5.2 Projections- Perspective projections 1

5.3 Visible surface detection algorithms- Back face detection. 1
5.4 Depth buffer algorithm 1
5.5 Depth buffer algorithm 1
5.6 Scan line visible surface detection algorithm 1
5.7 Scan line visible surface detection algorithm 1
5.8 A buffer algorithm 1