: ' \'

'

~6

(ICf I

II[

Time. J.oo I Irs

t

Note : Attempt any five questions.

o.f

M , M ork

....

10

i' _-ju....--,

"~ ""Jl !
---;

QL

by Explain all the

7)/Dcfi

1nc

2.

steps

.i
e
c
pa

in 3D viewing pipeline

es
g
olle

.
.
.
.
...
czrcr CUrves. DI.SO..LSS thCJr propcrocs aod lurul:ltons

b/Wruu is th e rcbtionship among!'t the fo llo wing

.c
w
ww

_\

1
."'-.{
.:

4o l '

-:c~ ... rv~ . o . ,)l::: r

.,., (

I (

l .. L' -'

)/ ,- {:/) _:)
I

~\)v ' '..; ~ ,J ..,.~V'/

' l '\).._,'

D/ ~ '~ \.!"

... . .....

I .

l 'l

J'-l n'-"'

fl

J '::

I
~

. . . . ,.

...

I
#

.:

,,.

L- :::-.~ : .: i~ ..- :-:h.f':: . :: h'h~~ ~! : ~.J.n li.nc p(,l ~ !.!(.~ :-~ :i ! t:r: ~ ~.ftit~ ;;~s.o ::. wh)St: ,-~rfl t:c..~ m ihc:
ci ~::. '' l s ;:--d: rtX:lwn :!.r~ .sn ..orhd ow:

-- -

.-\( 1. 1). nn.4). C(--1.8). 0(6,7). E(7,3),"F(5,2)

-7 t

!1

E-q:J..ain th~ Sutherland Hodgman algorithm for clipping polygons.

a.._

uo ,,..

~~.' L~

-;r

l ~- -

thc transOrmall()n
<

;.or rO!atlo!! o f an ob"

matnx
~ea auuu any arbnrary
axes, L-.
...... JS

J, par.illel to one of the coordiDalc axes.

., .

b). Fine the transformation matrix for oblique p ~ojcction onto the XY pl311<.

.i
e
c

sp
e
g
lle

/ ayFind the transformation matrix that transforms a givea square

6

ABCD to half its size with centre

still remaining at the same position. The coordin:ucs of the square arc A(!. I). 8(3,1), C(3,3),
D( 1 .~) and centre at (2.2).
4

b/ Wh:u is tb~ n=sity of JD clipping. Explain :>ny one JD ctipping algonthm .

(2+4)_

cy Wl12I do you mean by homogeneous coordinate system w 20 and JD

co
.
w

ww

Q7
~ 6

a)

PcrfQml a 45' rotation of a triangle A(O,O). B(l,l) and C(5,2) about P(-t.- 1)

o b) List tbc steps in clipping the following lines using the Cyrus beck line clipping algorithm against
a rccungu lar window "hose coordinates arc (10,10) and (100, 100).
L

Pl(-10,-20) and p2(50,40)

b. PJ(70,20) and p<I(IOO,JO)

c) Comp:u-c RGB, CMY and HVS colour models

CJJ Write shon notes on any two of the following

a)ft-Spline curves

bY loput devices
c) Hcnni!c curves
..:J'd'l' Viin.:!..:w to Viewport tr..msfornt:~ rion

4
4
14

Total No. of Page(s): 3

Roll No .... ....

FOURTH SEMESTER
B.E. (ICE)
B.E. END SEM. EXAMINATION, Mal'-2008
IC~214: PRINCIPLES OF COMPUTER GRAPHICS
Ti m~ :

Mux . MArk o: 70

3:00 fl ro.

NOte: AttemPt any FIVE questions. All questions carnJ equnl mnrr<
Assiline suitabls mts.'iin data i nnr .
--
1.
[a] Develop the 'Integer version of .Bresenhom '" l.on r dra11~

n
i
.
e

algorith m for Unei In thJrd quadrant ..., .

) 51
[b] .A:>er!ve the transformation matrix (i n horJ>ogcneou s
;,_;/ eoord Jnotea) to rotate A 30 Obj ect by an Allt:le'1\ AbO \It nn
arbi trAl)' axia parallel to but not colncide.n , With z-nxis . ([>)
(c) Draw the Bezler eurve delintd by thee
rol pints!? , 1). (3 . ~ 1 .
(5,0) nnd (6,2). By properly chooa
an other ct or control
point draw a bezi.er cubic cui"'V s uch th at the !'ccon 1 c: u rvc
. is joined smoothly with the
t curve.
/1)

e
l
l
o

.c
w
ww

c
a
p

s
e
g
::1.

(~) Conside r a rectangle

the following com er coorclin:.r r
.
.
p, (3,1,3), 2 (3,5,3), Po .(5,5,3) o.nd p, (5,1 ,3}
: . .an.d a triangle
the follO>!Ing coordinate:
.
Tr (4 ,4J , . T2 (3,3, 1}, To (5,2,1)
. , Colour or e recblngle Ia black and tria ngle is r',r" t'lo
Apply
y h,idden s urface remova l Algorithm "' ~hu,, "'tuh'~
surf cs.
.
;,,1
(b) W at is Hermlte Spline? l"ind the coc(licio::t "" . :, ' ,. ..
ermite spJlne . .' ~.
Derive the transformation ma trix fo r n~ Oc r.liun :1( ~~~ '
.I nbo ut an aroi trary line aa shown in Pis .- 1.

-/

c..L' ' )

I'

q,'l,~

'

I ..

(aJ Vc~!or /I ;mull ar1. Jcflltcu as l.' i l k a1:ci 2i+J k. ,\ i ! II ,crlor

/, --~~tvr ll. Gi1~ th, ihaltr~nslimuat i <>n mu1rix.

,_. \'iewpon
for u
\L 5,30) 111 a wmdow. r he Window descri be<] as (0,0). (50,0),
C-'9 SO), ({1.50 ) where ,.,, view pun '" k~cribcu ;~s (O,OJ , t \ il,O),

~(Pcn~1.m Wi~uow

lran~formution

P~nl

U.;iO, 50) :I IIII (I PI), .Ill! .

~)!lillilentialc wcighlt:d Area sampling

samplin;1.

11

1th. Unwcighl"l Area

[~ .o I]

(~) Draw il:c Bczicr cur.c delined hy Ihe control poin1s ( l, I ), (3 ,2),
(5,0) an(. (6,2).' By prop::rly choos ing anolhcr set of cont1ol pui ms
dr~w ~ El~>~.icr cubic cun~ sucj1tha11hc second curve is j.oind
smooth!, with 1hc (jrst l urvc.
(h) Expl~in thf;![vie~:in)O pipcl i;;:
(C) F ~ ~l::~ i:-: !h: ~~~ vf C.mapl.!h.:r gra ptllcs in Engineering icld .
[5,5,.:j
Q.i .

e
l
l
o
c
.
w

ww

(a) A Pyramid A( I, 1,1), 13(2, 1,1), C( I,2, I j and D( I, I,2) i:: housed
insid e a cube of 5 unit length. Ptrfom1 normalized trans formalion
1n a t:;,i1ct:ht... Gi v.: 1hc ll':tnsfonn..d coordin:ucs cJf pyl':: tn;d.

(h l <i jv"'n th. . lh'rspt.:~o.' l h ~ tr~ nsflH'II\alt lll t lltOHri.'( , shuw hu, til..:
vanishing pO iillS may b~ iocalcd.
~Jt: li~1e shud0 w ma~k . '
(~ nc

96.

Asp;:c1 ru110.

.:..\[zyl;,y s y~ t c m .

(~)Yhu i do you understand by VGA and S\'GA 1:10u11ors.

(5,5.~ )

'

n
i
.
e

07.
{u )Whui is 1hc fundament~! d1l'lerence 1n ihc mc1 hc~ oi' o;;crul l'r
' 'or a monochrome CRT and J ~olor CRT.
(b) A cub e has i1s vertices loc~1ed a1 (Q,O,S), U15.'J.l i, C(5,5.5 ).
D(U,5, 5), E(O,O,O), F(5,0,0), 0 (5 ,5,}), 11(0,5.0) The 1'.1 \1 , 1;
v~rt ic ..! :1nd pos itive Za:ds is ori cnlcd tow~r~fs lh!! \ I\! \ \ cr. 1 nc
cu be is be ing viewed from tl1o point (0, IO,JO). \vor~ OU!Ii1c
per~p ccti ve view of the cube ur. the XY plane.
~ Compare parallel and perspccriw proj~,:110n " lin rd~r~ncc :?
pracl ical usc only.

{j. 7 .: J

c
a
p
s
ge

'
Q~ .

1-?tl IVIlh ;, ll~~t hlo~k ui;I~I'Jl ol, ~.\ piJIII ih~ .1(, 1':1~, .r~ or'; t~

[5,4..~ 2]

J~l A Window described as A(l ,5), 8(3,2), C(5,2), D(7,5.J md

' E(~,7). Pcrfi>ml Cyrus b"k approoch 10 clip a line ogoins11he
given winucw. Wrilc 1h~ algorithm s1eps ~nd example in. S!ppon.

'

{....

'J'ucal No. oj l:'ugc:(s): :J

FOURTH SEMESTER
B E.. (I CE)
B .E . END SEM. EXAMINATIO , Mo.; 2009
IC-214: COMPUTER GRAPHIC S
Time : 3:00 Hrs .

INo te:

Max

1.

_.-

ll ,,.

e
.J
l
l
o
)

c
.
w
w
w

7()

n
i
.
e

[a] Modify Bresenham's Line drawing a\gonthm 'o that 1t

will produce
/
!) Dashed lin~ - . The d~sh len gth should be
independent of slope
/
!!) A line of thickness ~::pl;uls .
,6)
(b) Use the midpoint method and symme try cun"dc r.tH>n'

c
a
p

s
e
g
/

~larks

Att emp t ANY FNE question s . All questions carnt equal rn o rks

to s can convert a parabola y =100x

] Derive the transformation matrix for sco.l!nfl an
by u scaling factors in a descrip tion 'fJCCifll'd
direction an gles a, 13 and y.

[;>:f Thc _coord in a tes of the

{51
ol:JcCt
by lhc
\JI

vcrtic~s of a poi\'J~'"' .trc ~l.uw:

B(i;e)

._/ - Ill f"'1g .-1 .

..,, (~,1)

..... , (.'l.,~)

-. . ( CI' ,~)

" :J

t~ . ~, )

L-------;>- 'f

Ftg - 1

Us ing solid ar~a scan conversion a lgonthm -;how h >v

the interior of the polygon is filled .
1~Briefly explain the viewi ng pipeline wh1k cli~l''"):''"g .JD.
objects on a 2D screen .
1:11
,j91Prove that the multiplication of thccc-d>mc ,-, 10nill
transformation matrices for each of I!H folt J\o,;ng
sequence of operations is commut ative
.___.,-(Y,Any two s uccessive translations
\.,l1) Any two su ccessive rotations a bout dny
rnrHt lin : \1~

::.v,...._

3.

[c) Determine 3D transformaiion ma tr ices to scille the line.

AB in z di.rection by 3 .5 by keeping poin t II fixed . Then
rota te this line by 450 anticlockwise abou t x-axis
Giuen A(J 0, 15, 2 0) and 8(45, 60, 30}.
[4 J

[,.0Vhat IS the s~q.ucncc of, transform ations required to

.,/ chanr,c th e positiOn of obJeCt shown 1n F'ig. -2 to Fig.-3 .

c~

1~,7
c.

[a] Deflne bczler curves. Discu ss their properties and

limitations.
14]
[b] Suppose an image of a 3D wo rld, viewed fro m a
particular position is projected on to a clispl<~y a rei\ on a
monitor .
Derive the equ a tions for a perspective
projection , which given the view c o o rclnl:tt<~ of" p01n t in
3D space , produce th e u ser coord inates of the pui n t P
thnt projects onto.
J(i j
(cj ri n d ll trtUlllfO I' InO l ioll 1\Hll.rix wilkil .111~11' the t'<'C\ 01'
V = i + .i + K with the vector N =2/ - .7 - 1-.'
f41

; t

..

-~

<----'\~~

)(

-1
l~ig.-2

Fig.-3

[hi 1\ 11\w Will\ ' lldes of lcn~l.h ~ is plac:<:u '"'that a corners

lws ''" the t~rigin nnd three mutually perpendicular

11>,1111 tl11s c()rllCr lie ou thre e po~ i tivc coordinate
""''~
l'e1 form ' n ~ - point persp~cti vc projection on ti1e
l '. \.lhc

Oil

the

;', .. ()

plo.n<.:

wilh

ur

GCnt rcS

4,

Ia] s 'hu w

Q(t) = (,"

U\at
l.

two
1 -t

c
.
w
w
w

curves

6.

g
e
l
ol

p1 "JCC:tlnn v " - 10, J' :. -I 0 ond 7.= 10 on the respective

coordllldt<: :.~xe s . liivc the coord ina te s of U1c projected
171
eubc .
~cflJcs<.:r illc bricOy the applications of computer graphics.

1'(t)=V 2 - 2t, t)

131

and

1) arc both C' and G' continuous where

they jn1t1 at 1'(1) = Q(O).

151
(bj /\n "H '' 1s <.:on~tnl,ctcd by joi n ing to~cthc r two cubic
lJe?.><:r <'III 'VC~. ouc for th e tnp hal f, til~ other for the
1Joll<>ll1 half.
Show how the 4 po in ts have to be
arran ed for each curve (two end pints and two control
point~l sn that the CUI'VCS join s smoothly
151

n
i
.
e
c
a

p
s
e

' de:< ~

ll.lll'ol ! l h ' tl

''

5.

[o.] Give n points A (4 .5, 6 .8) , B(-1.2 . l.O) and C'(l'4. -2 S).
Fi nd their res pective screen ' eourd in..ttes
u~e the
fo ll owi ng assum ptions: th e scree n is :i 12 Y5 12 pixels
and the window is the minim um square that encloses
the points and Gil th e upper lift quadrant of the sc reen

!61

J l 'The reason that homogeneou s coo rd1natcs are

a ttractive is that '3D points at infi nity in Cartesia."l
coordinates can
be
represented
cxplic1tly
in
homogeneous coordinates. How can th is be done ? 121
~escribe with the aid of a diagram, the st <~ gcs involved
[6]
in rotating an obj ect about an arbitrary a'os .
Write short n otes on any four of the followmg
Ran dom Scan and Raster Scnn
[b] NLN Line clipping algorithm .
~] Dir~ct View-Storage Tube (DVST)
[d) Welter-Atherton polygon clipping
~ ) Wi nd ow to viewport t rn n :< form<~ti o n
licrbnitc curves.

,./l'al

::.Jt(

111 J

Roll No. _ __

Tot-dl No. of Pages: 3

FOURTH SE.MSTR

BE (ICE)

END SEMESTER EXAMINATION, May -2011

ICE-214: PRINCIPLE OF COMPUTER GRAPHICS

n
i
.
e
c
a
p
s
e
leg
Time: 3 Hrs.

Max. Marks: 70

Note: Question 1 i~ Compulsory and Attempt QIIY FOUR Quest/oM

from the rest
All Questions carry equal marks
Assume suitable missing data,

l
o
c
.
w
w
w

if any.

QI.

(a) Compute the size of a 1024X768 image at 480 pixels per inch.
(b) 1fan image has a height of 4 inches and an as pect ratio of'! ., what
is its width?
(c) What are the major adverse side effects of scan conversion?
(d) What are the new coordi nates of the point P( -4, 2) after the
rotation by 30 about Q( I, 3).
(e) Find a normalization transformation from the window whose
lower left corner is at ( 1, 1) and upper right comer is at (5, 4) onto
the nonnalized device screen so that as pect ratios are preserved.
(I) Give the transformation matrix for mirror reflection with respect
to tl1e Y-Z plane.
(g) Find tl1e transformation for cabinet projections with 8 =30.
[7X2]

Q2.

(b) D1scuss the nature of blending function used in Bezior curve

formu l3tion .

(a) ruur poiniS Po(a, b), 1' ,(20, 50), P1(40, 40). 1' 3(70, 6) "'f' available
for draw ing a B- pline curve segment. orn pute the values of a,
b, c such that Lhe c urve s tariS from tho point (2 1, 43) and
termi nates with slope (- !12).

(c) Why arc homogeneous coord inates used for transformation

com putation in Compuler Graphics?
[7, 4, 3)

fl5 .

b) Deve lop the integer versio n of Brescnham's circle drawing

algorithm fo r c ircle arc in the third quadran!.

(a) What is oblique projection? Provide orne exam ple of oblique

projection.

(c) What is the Convex Hull pro perty of Bezier curves? How is it
(6, 4, 4]
satisfied?

(b) State the reaso n why we prefer unit x interval or urut y interval
for corresponding slopes m :S I and m ;:: I in line drawing
a lgorithm.

A cube has its vertices located at A(O, 0, 5), B(S, 0, 5), C{5, 5, 5),
D(O, 5, 5), E(O, 0. 0), F(S, 0 ,0), G(S, 5, 0), H(O, 5, 0). The Y axis
is vertical and positive z axis is oriented towards the viewer. The
cu be is viewed from the point (0, I 0, 40). Work out the
perspective view of the cube on the XY plane.
b) Explai n Polygon filling approach th rough VERTICAL
SCANN ING on a given polygon whose vertices are PI (2, 8),
1'2(6, 14), P3 (8, 10), 1'4(4, 2). Give the data structure that
describes the edge.
L
Construct the Global Edge Table
11.
Trave rse the Active Edge Table in filling the given
polygon.
c) The reflection along the line y = x is equivalent to the reflection
along the X axis fo llowed by counter clockwise rotation by e
degrees. Find the value of e.
(6, 6. 2]

~ n/

Q4.
(a) A clipping window ABCD is specified as A(30. 60), 8(70, 60),
C(90. 20), D( 1O, 20). We want to clip two lines P(S, 25) Q(95,
45) and R(2, 45) 5(40, 0) against the window. Use a suitable li~e
clipping algorithm to find visi ble portion of the lines. Explam

your approach clearly.

c
a
p

others when viewed from C.

es

g
e
l
ol

c
.
ww

n
i
.
e

(c) Given points P 1 (2, 4, 0), P2 (6, 12, 40) and 1'3 (4, 8, 12) and a
view point C{O, 0, -20), determine wh ich points obscure the
[5, 5, 4)

Write short notes on the followmg

(a) Principle Vanishing Point
(b) Weighted and Un-Weighted Area Sampling in Anti-Aliasing
(~ Painter Algorithm of Hidden Surface
('a) Weiler Atherton of Polygon clipping
(J Y,X 4J

----Y----