IV B.

Tech I Semester
Student Handbook
For

Computer Graphics
Mr.Naveen kumar Reddy
Mrs.Srilatha

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

UNIT I
Syllabus:
Introduction, Application areas of Computer Graphics,
o v e r v i e w o f g r a p h i c s s y s t e m s , v i d e o - d i s p l ay d e v i c e s ,
raster-scan systems, random scan systems, graphics
monitors and work stations and input devices.

Objectives:

L e a rn i n g a b o u t t h e a p p l i c a t i o n a re a s o f c o m p u t e r
graphics.
L e a rn i n g h o w t o d i s p l a y a v i d e o b y u s i n g C RT , Ra s t e rscan system and random scan systems.
L e a rn i n g a b o u t t h e m o n i t o r s t o d i s p l a y t h e g r a p h i c a l
images.
L e a rn i n g a b o u t t h e i n p u t d e v i c e s n e e d e d t o i n p u t t h e
data to the graphical system.

Lecture plan:
SN
O

TOPIC

N O. O F
LECTURES

I n t ro d u c t i o n , A p p l i c a t i o n a re a s o f c o m p u t e r
graphics,Overview of graphics systems.

Vi d e o d i s p l a y d e v i c e s - - C RT

Ra s t e r- s c a n s y s t e m s

Ra n d o m s c a n s y s t e m s

Graphic monitors

Input devices

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

Important Questions:
1 . W h a t a re t h e m e r i t s a n d d e m e r i t s o f r a s t e r- s c a n C RT ?
2.List and explain the applications of computer graphics?
3.List the operating characteristics of
a . Ra s t e r re f re s h s y s t e m s
b . Ve c t o r re f re s h s y s t e m s
c. Plasma panel
d. LCD

Assignment Questions:
1 . A s s u m i n g t h a t a c e r t a i n f u l l - c o l o u r ( 2 4 - b i t p e r p i xe l ) R G B
r a s t e r s y s t e m h a s a 5 1 2 b y 5 1 2 f r a m e b u ff e r , H o w m a n y
distinct colour choices (intensity levels)would be available?
2 . C o n s i d e r a r a s t e r s y s t e m w i t h re s o l u t i o n o f 6 4 0 4 8 0 . H o w
m a n y p i xe l s c o u l d b e a c c e s s e d p e r s e c o n d b y a d i s p l a y
c o n t ro l l e r t h a t re f re s h e s t h e s c re e n a t a r a t e o f 6 0 f r a m e s p e r
s e c o n d . W h a t i s t h e a c c e s s t i m e p e r p i xe l ?

UNIT II
Syllabus:
Output
primitives: Points and lines, line
drawing
algorithms, mid-point
circle and ellipse algorithms.
Filled area
primitives:
Scan line
p o l y g o n fi l l
a l g o r i t h m , b o u n d a r y - fi l l a n d fl o o d - fi l l a l g o r i t h m s .

Objectives:

L e a rn i n g t h e a l g o r i t h m s f o r d r a w i n g t h e l i n e , f o r d r a w i n g
t h e c i rc l e w i t h m i d p o i n t a l g o r i t h m a n d d r a w i n g t h e
ellipse with midpoint ellipse algorithm.

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

L e a rn i n g a b o u t t h e fi l l e d a re a p r i m i t i v e s l i ke p o l y g o n s
a n d a l g o r i t h m s f o r p o l y g o n fi l l i n g w i t h s c a n l i n e fi l l
algorithm,
boundary
fi l l
algorithm
and
fl o o d
fi l l
algorithm.

Lecture plan:
SNO

TOPIC

N O. O F
LECTURES

Output primitives

Line drawing algorithms

M i d p o i n t c i rc l e a l g o r i t h m

Mid point ellipse algorithm

Fi l l e d a re a p r i m i t i v e s

S c a n l i n e p o l y g o n fi l l a l g o r i t h m

B o u n d a r y fi l l a l g o r i t h m s

F l o o d fi l l a l g o r i t h m s

Important Questions:
1 . W h a t a re t h e s t e p s re q u i re d t o p l o t a l i n e u s i n g s i m p l e D DA
methods?
2 . W h a t a re t h e s t e p s re q u i re d t o p l o t a l i n e u s i n g B re s e n h a m
method?
3 . Wr i t e a n a l g o r i t h m t o d e r i v e t h e s t r a i g h t l i n e u s i n g
B re s e n h a m a l g o r i t h m w h e n t h e s l o p e o f t h e l i n e i s l e s s t h a n
4 5 d e g re e s ?

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

Assignment:
1 . S h o w w h y t h e p o i n t - t o - l i n e e rro r i s a l w a y s < = 1 / 2 f o r t h e
midpoint scan conversion algorithm?
2.Indicate which raster locations would be chosen by
b re s e n h a m a l g o r i t h m w h e n s c a n - c o n v e r t i n g a l i n e f ro m s c re e n
c o o rd i n a t e ( 1 , 1 ) t o s c re e n c o - o rd i n a t e ( 8 , 5 ) ?

UNIT III
Syllabus:
2 D - g e o m e t r i c a l t r a n s f o r m s : Tr a n s l a t i o n , s c a l i n g ,
rotation,
r e fl e c t i o n a n d s h e a r t r a n s f o r m a t i o n s , m a t r i x
representations
andhomogeneous
coordinates,
composite
transforms,
transformations
between
coordinate systems

Objectives:

Learning how
another point
Learning how
Learning how
Learning how
ordinates and

to transform a 2D object from one point to

to increase(Scaling) an object size.
to rotate an object at some angle
to represent 2D object in the homogenous cotransform using homogeneous co-ordinates

Lecture plan
SN
O

TOPIC

NO OF
LECTURES

1.

2D translation

2D scaling

2 D Ro t a t i o n

2 D re fl e c t i o n

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions
5

2 D s h e a r t r a n s f o rm a t i o n

Matrix
re p re s e n t a t i o n s
homogeneous

and

C o - o rd i n a t e s
7

C o m p o s i t e t r a n s f o rm s

Tr a n s f o rm a t i o n s
c o o rd i n a t e s y s t e m s

1
between

Important Questions:
1 . Wr i t e t h e g e n e r a l f o rm o f a s c a l i n g m a t r i x w i t h re s p e c t t o a
fi xe d p o i n t p ( h , k ) w h e re t h e s c a l i n g f a c t o r s i n x a n d y
d i re c t i o n s a re a a n d b re s p e c t i v e l y ?
2 . S h o w t h a t t h e t r a n s f o rm a t i o n m a t r i x f o r a re fl e c t i o n a b o u t
t h e l i n e y = x i s e q u i v a l e n t t o re fl e c t i o n re l a t i v e t o t h e x a x i s
f o l l o w e d b y a c o u n t e r c l o c k w i s e ro t a t i o n o f 9 0 d e g re e ?
3 . P ro v e s c a l i n g a n d ro t a t i o n i s c o m m u t a t i v e ?

Assignment:
1 . D e r i v e t h e g e n e r a l f o rm o f ro t a t i o n m a t r i x w i t h re s p e c t t o
fi xe d p o i n t p ( h , k ) ?
2 . A n o b j e c t p o i n t P ( x , y ) i s t r a n s l a t e d i n t h e d i re c t i o n U = a I + b J
a n d s i m u l t a n e o u s l y a n o b s e r v e r m o v e s i n t h e d i re c t i o n U .
S h o w t h a t t h e re i s n o a p p a re n t m o t i o n o f t h e o b j e c t p o i n t
f ro m t h e p o i n t o f v i e w o f o b s e r v e r ?

UNIT-IV

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

Syllabus:
2-D viewing: The viewing pipeline, viewing coordinate
reference frame, window to view-port coordinate
transformation, viewing, CohenSutherland and Cyrus-beck line clipping algorithms,
Sutherland-Hodge man polygon clipping algorithm.

Objectives:

L e a rn i n g h o w t o v i e w t h e 2 D o b j e c t .
L e a rn i n g h o w t o c l i p a n o b j e c t u s i n g C o h e n - S u t h e r l a n d
and Cyrus-beck line Clipping algorithms.
L e a rn i n g h o w t o c l i p a n o b j e c t u s i n g t h e S u t h e r- H o d g e
man polygon clipping algorithm.

Lecture plan
SN
O

TOPIC

NO OF LECTURES

The viewing pipeline

Vi e w i n g c o o rd i n a t e
re f e re n c e f r a m e

W i n d o w t o v i e w - p o r t c o o rd i n a t e
t r a n s f o rm a t i o n

Cohen-Sutherland and Cyrusbeck line clipping algorithms

2
Sutherland-Hodge man
polygon clipping
algorithm.

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

Important Questions:
1 . Fi n d t h e g e n e r a l f o rm o f t h e Tr a n s f o rm a t i o n
re c t a n g u l a r w i n d o w w i t h e x t e n t x w m i n t o x w
d i re c t i o n a n d w i t h y e x t e n t y w m i n t o y w m i n
d i re c t i o n o n t o a re c t a n g u l a r v i e w p o r t w i t h x
to xv max and y extent yv min to yv max.

N which maps a
min in the xin the y
extend xv max

2 . J u s t i fy t h a t t h e S u t h e r l a n d - H o d g e m a n a l g o r i t h m i s s u i t a b l e
for clipping concave polygon also?

Assignment:
1.Using steps followed in Sutherland-Hodge man algorithm
d e t e rm i n e t h e i n t e r s e c t i o n p o i n t o f t h e l i n e s e g m e n t p 1 p 2
a g a i n s t a c l i p p i n g w i n d o w p 3 p 4 w h e re c o o rd i n a t e s o f e n d
p o i n t a re p 1 ( 0 , 0 ) p 2 ( 3 , 0 ) a n d p 4 ( 0 , 2 ) ?
2 . L e t R b e a re c t a n g u l a r w i n d o w w h o s e l o w e r l e ft c o rn e r i s a t
L ( - 3 , 1 ) a n d u p p e r r i g h t - h a n d c o rn e r i s a t R ( 2 , 6 ) . I f t h e l i n e
s e g m e n t i s d e fi n e d w i t h t w o e n d p o i n t s A ( - 1 , 5 ) a n d
B ( 3 , 8 ) . D e t e rm i n e
a ) T h e re g i o n c o d e s o f t h e t w o e n d p o i n t s
b)Its clipping category and
c)Stages in the clipping operation using CohenSutherland algorithm.

UNIT-V
Syllabus:
3-D object representation : Polygon surfaces, quadric
surfaces, spline representation, Hermite curve, Bezier
curve and B-Spline curves, Bezier and B-Spline surfaces.
Basic illumination models, polygon rendering methods

Objectives :

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

L e a rn i n g h o w t o p ro d u c e re a l i s t i c d i s p l a y s o f t h e s c e n e s
u s i n g 3 D re p re s e n t a t i o n s t h a t m o d e l t h e o b j e c t
characteristics.

Lecture plan
SN
O

TOPIC

NO OF
LECTURES

Po l y g o n s u r f a c e s , q u a d r i c
surfaces

S p l i n e re p re s e n t a t i o n

H e rm i t e c u r v e

Bezier curve curveand B-Spline

curves

Bezier and B-Spline surfaces

Basic illumination models

Po l y g o n re n d e r i n g m e t h o d s

Important Questions
1.State the Blending function used in B-spline curve
g e n e r a t i o n . E x p l a i n t h e t e rm s i n v o l v e d i n i t ? W h a t a re t h e
p ro p e r t i e s o f B - s p l i n e c u r v e s ?
2 . D e t e rm i n e t h e b l e n d i n g f u n c t i o n s f o r u n i f o rm p e r i o d i c B spline curve for d=6?

Assignment:

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions
1.Given the plane parameters A,B,C and D for all surfaces of
a n o b j e c t , e x p l a i n t h e p ro c e d u re t o d e t e rm i n e w h e t h e r a n y
s p e c i fi e d p o i n t i s i n s i d e o r o u t s i d e t h e o b j e c t ?
2 . E x p l a i n t h e p ro c e d u re f o l l o w e d i n B e z i e r s m e t h o d s f o r
curve generation?
3 . L i s t a n d e x p l a i n t h e p ro c e d u re s f o l l o w e d i n d i ff e re n t s m o o t h
shading algorithms. Analyze the computational complexities
in each?

UNIT-VI
Syllabus:
3 - D G e o m e t r i c t r a n s f o r m a t i o n s : Tr a n s l a t i o n , r o t a t i o n ,
s c a l i n g , r e fl e c t i o n a n d s h e a r t r a n s f o r m a t i o n s ,
composite transformations.
3-D viewing :Viewing pipeline, viewing coordina tes,
view volume and general projection transforms and
clipping.

Objectives:

L e a rn i n g h o w t o t r a n s f o rm a 3 D o b j e c t u s i n g t e c h n i q u e s
l i ke S c a l i n g , Tr a n s l a t i o n , Ro t a t i o n , re fl e c t i o n a n d S h e a r
t r a n s f o rm a t i o n .

L e a rn i n g h o w t o m a p 3 D o b j e c t o n t o t h e 2 D d i m e n s i o n a l
s u r f a c e u s i n g p ro j e c t i o n t e c h n i q u e s .

Lecture plan

10

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

SN

TOPIC

N O. O F
LECTURES

O
1

Tr a n s l a t i o n , r o t a t i o n
transformations

S c a l i n g , r e fl e c t i o n
transformations

Shear transformations

Composite transformations

Viewing pipeline and viewing

coordinates

Projection transforms

Clipping

I mp o r t a n t Q u e s t i o n s :
1 . P ro v e t h a t t h e m u l t i p l i c a t i o n o f 3 D t r a n s f o rm a t i o n o f a n y
two successive translation matrices is commutative?
2 . D e r i v e t h e m a t r i x f o rm f o r p e r s p e c t i v e p ro j e c t i o n
t r a n s f o rm a t i o n u s i n g 3 - d i m e n s i o n a l h o m o g e n o u s
re p re s e n t a t i o n . w i t h t h e a n e a t s ke t c h , d e s c r i b e v a r i o u s
p a r a m e t e r s i n v o l v e d i n t h e m a t r i x re p re s e n t a t i o n ?
Assignment:
1 . I f p ( x , y , z ) i s a n o b j e c t re f e re n c e p o i n t f o r s c a l i n g , e x p l a i n
n o w t h e s c a l i n g o p e r a t i o n i s d e fi n e d i n t e rm s o f s c a l i n g w i t h
re s p e c t t o o r i g i n ?

11

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions
2 . D e r i v e t h e q u a t e rn i o n ro t a t i o n m a t r i x f o r ro t a t i o n a b o u t a n
a r b i t r a r y a x i s i n t h re e - d i m e n s i o n a l d o m a i n ?
3 . G i v e n a u n i t c u b e w i t h o n e c o rn e r a t ( 0 , 0 , 0 ) a n d t h e o p p o s i t e
c o rn e r a t ( 1 , 1 , 1 ) , d e r i v e t h e t r a n s f o rm a t i o n s n e c e s s a r y t o
ro t a t e t h e c u b e b y t h e t a d e g re e s a b o u t t h e m a i n d i a g o n a l
f ro m ( 0 , 0 , 0 ) t o ( 1 , 1 , 1 ) i n t h e c o u n t e r c l o c k w i s e d i re c t i o n
w h e n l o o k i n g a l o n g t h e d i a g o n a l t o w a rd t h e o r i g i n ?

UNIT-VII
Syllabus:
V i s i b l e s u r f a c e d e t e c t i o n m e t h o d s : C l a s s i fi c a t i o n , b a c k f a c e d e t e c t i o n , d e p t h - b u ff e r, s c a n - l i n e , d e p t h s o r t i n g ,
BSP- tree methods, area sub- division and octree
methods
.
Objectives:

L e a rn i n g h o w t o re m o v e t h e s u r f a c e s o r l i n e s w h i c h a re
not to be displayed in a 3D scene using visible surface
d e t e c t i o n p ro c e d u re s .

Lecture plan:
SN
O

TOPIC

N O. O F
LECTURES

C l a s s i fi c a t i o n ,

Back-face detection

D e p t h - b u ff e r

Scan-line

Depth sorting

BS P - t re e m e t h o d s

12

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions
7

A re a s u b - d i v i s i o n a n d o c t re e
methods

Important Questions:
1 . H o w d o e s Z- b u ff e r a l g o r i t h m d e t e rm i n e w h i c h s u r f a c e s a re
hidden?
2 . E x p l a i n BS P-Tre e m e t h o d i n d e t a i l ?
3 . C o m p a re a n d c o n t r a s t d e p t h - b u ff e r a n d d e p t h - s o r t m e t h o d s ?
Assignment:
1.A polygon has a plan equation ax+by+cz+d=0.Suppose that
we know the value of Z at a point (x,y) .What is the easiest
way to calculate the value of z at (x+1,y) and at (x,y+1)?
2.Assuming that one allows 2 power 24 depth value levels to
b e u s e d , h o w m u c h m e m o r y w o u l d a 1 0 2 4 x 7 6 8 p i xe l d i s p l a y
re q u i re s t o s t o re t h e z - b u ff e r ?

UNIT-VIII
Syllabus:
Computer animation :Design of animation sequence,
general computer animation functions, raster
a n i m a t i o n , c o m p u t e r a n i m a t i o n l a n g u a g e s , ke y f r a m e
s y s t e m s , m o t i o n s p e c i fi c a t i o n s .
Objectives:

13

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions

L e a rn i n g g e n e r a l f u n c t i o n s n e e d e d f o r a n i m a t i o n o f
scenes.
L e a rn i n g t h e l a n g u a g e s t o b u i l d t h e a n i m a t i o n s c e n e s .
L e a rn i n g t h e c a t e g o r i e s o f a n i m a t i o n .

Lecture Plan:
SN
O

TOPIC

N O. O F
LECTURES

Design of animation sequence

General computer animation

functions

Ra s t e r a n i m a t i o n

Computer animation languages

Ke y f r a m e s y s t e m s

M o t i o n s p e c i fi c a t i o n s

Important Questions:
1 . W h a t a re t h e i s s u e d i n v o l v e d i n d e s i g n o f a s t o r y b o a rd
l a y o u t w i t h a c c o m p a n y i n g ke y f r a m e s f o r a n a n i m a t i o n o f a
s i n g l e p o l y h e d ro n ?

2.What is the mechanism followed for tracking live action in

animated scenes?
3 . D e s c r i b e t h e p ro b l e m o f t e m p o r a l a l i a s i n g ?

Assignment:

14

Dept. of Computer Science Engineering, School of Engineering,

Anurag Group of Institutions
1.List and explain about the steps of animation and various
types of interpolation used in animation?
2 . D e fi n e t h e t e c h n i q u e m o r p h i n g . E x p l a i n h o w s i m u l a t i o n
a c c e l e r a t i o n s w i l l b e c o n s i d e re d i n ke y- f r a m e s y s t e m s ?

15