View
220
Download
0
Category
Preview:
Citation preview
8/13/2019 Computer Graphics III It Hb Updated
1/40
11 COMPUTER GRAPHICS
Course Objective
The subject computer graphics is aimed at learning the details of picture generation, simulation,animation, modeling and rendering 2-D & 3-D objects, in order to create objects that look and
behave as realistically as possible.The course progresses through a designed set of units, starting
ith simple, general applicable fundamentals and ending ith more comple! and speciali"ed
subjects. This course also provides a strong base for image processing research for the students.
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age "
8/13/2019 Computer Graphics III It Hb Updated
2/40
11.1 JNTUH SYLLAUS
UNIT !I
I"tro#uctio"$#pplication areas of $omputer %raphics overvie of graphics systems, video-displaydevices raster-scan systems, random scan systems graphics monitors and ork stations and input
device.
UNIT % IIOut&ut &ri'itives ( oints and lines, line draing algorithms, mid-point circle and ellipse
algorithms. 'illed area primitives( )can line polygon fill algorithm, boundary-fill and flood-fillalgorithms
UNIT %III
)!* +eo'etric,- tr,"sor's(Translation, scaling, rotation, reflection and shear transformations,matri! representations and homogeneous coordinates composite transforms transformations beteen
coordinate systems.
UNIT % I/
)!* vie0i"+( The vieing pipeline, vieing coordinate reference frame, indo to vie-portcoordinate transformation, vieing functions, $ohen-)utherland and $yrus-beck line clippingalgorithms, )utherland-*odgeman polygon clipping algorithm.
UNIT % /
!* Object re&rese"t,tio"( olygon surfaces, +uadric surface, spline representation, *ermite
curve, e"ier curve and -)pline curves, e"ier and -)pline surfaces. asic illumination models,
polygon rendering methods.
UNIT % /I
!* Geo'etric tr,"sor',tio"s( Translation, rotation scaling, reflection and shear transforms
composite transformations.!* /ie0i"+( vieing pipeline, vieing coordinates, vie volume and general projection
transforms and clipping.
UNIT % /II
/isib-e sur,ce #etectio" 'et2o#s( $lassification, back-face detection, depth-buffer, scan-line
depth sorting, )-tree methods, area sub-division and octree methods.
UNIT % /III
Co'&uter ,"i',tio"(Design of animation se+uence, general computer animation functions, raster
animation, computer animation languages, key frame systems, motion specifications.
SUGGESTE* OO3S
T1( 4Computer Graphics C version5, Donald *earn & . auline aker, earson ducation.
T)( 4Computer Graphics - Principles & Practice5, )econd edition in $, 'oley, /andam, 'riner,
*ughes, earson ducation.
RE6ERENCES
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #
8/13/2019 Computer Graphics III It Hb Updated
3/40
R1( 4Computer Graphics, )econd edition, Donald *earn & . auline aker, *01 earson
ducation
R):Computer Graphics Second edition, higand !iang, oy plastock, )chaum4s outlines Tata
c %ra hill education
R(Procedural Elements for Computer Graphics, David ' ogers, c-%ra*ill 0nternational, 00
dition
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 3
8/13/2019 Computer Graphics III It Hb Updated
4/40
11.) U"it 0ise P-,""er or Ac,#e'ic Ye,r )711 ! )71)
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 4
S.No. U"it No. *escri&tio" Tot,- No. o Lectures
5. 0
0ntroduction &
#pplication areas of $omputer %raphics 6
2. 00 7utput primitives 58
3. 000 2-D geometrical transforms( 9
:. 0/ 2-D vieing 6
;. / 3-D 7bject representation 58
8/13/2019 Computer Graphics III It Hb Updated
5/40
11. Sessio" P-,""er
MLRI"stitute o Tec2"o-o+8>a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8
8/13/2019 Computer Graphics III It Hb Updated
6/40
MLRI"stitute o Tec2"o-o+8>a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8
8/13/2019 Computer Graphics III It Hb Updated
7/40
MLRI"stitute o Tec2"o-o+8>a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8
8/13/2019 Computer Graphics III It Hb Updated
8/40
MLRI"stitute o Tec2"o-o+8>a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8
8/13/2019 Computer Graphics III It Hb Updated
9/40
MLRI"stitute o Tec2"o-o+8>a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8a!ma eddy #venue, Dundigal, ?uthbullapur @A, *yderabad B ;88 8:3
hone Cos( 86:56 B 28:8
8/13/2019 Computer Graphics III It Hb Updated
15/40
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age "5
U"it
No.
S.
No.To&ic
Lecture
Nu'ber ,s
&er t2e
&erio#
*,te P-,""e# Re',r8
) #pplication areas of $omputer %raphics >5
7vervie of graphics systems video-display
devices>2
> video-display devices >3
? Tutorial T5
@ video-display devices >:
video-display devices >;B aster-scan systems andom scan systems >9
17 Tutorial T2
11 $lass Test $T5
II
U
N
I
T
1) oints and lines >ine draing algorithm >6
1 >ine draing algorithms >=
1> >ine draing algorithms >58
1? id-point circle >55
1@ Tutorial T3
1 id-point circle >521B llipse algorithms >53
1 llipse algorithms >5:
)7 'illed area primitives
)can line polygon fill algorithm>5;
)1 Tutorial T:
)) )can line polygon fill algorithm >559
)> $>#)) T)T $T2
III
UNIT
)? 0ntroduction to 2D geometrical transforms,
Translation>56
)@ )caling , rotation transformations >5=
) Tutorial T:
)B eflection transformations >28
) )hear transformations >25
7 matri! representations and homogeneous
coordinates>22
1 $omposite transforms >23
) Tutorial T;
Transformations beteen coordinate systems >2:
> $>#)) T)T $T3
I/UNIT ? The vieing pipeline, vieing coordinatereference frame >2;
@ indo to vie-port coordinate
transformation , /ieing functions>229
B Tutorial T6
$ohen-)utherland >26
>7 $yrus-beck line clipping algorithms >2=
>1 $yrus-beck line clipping algorithms >38
>) )utherland B*odgeman polygon clipping
algorithm>35
> Tutorial T=
>> )utherland B*odgeman polygon clippingalgorithm
>32
8/13/2019 Computer Graphics III It Hb Updated
16/40
Note( 6ort"i+2t-8 veriic,tio" b8 HO*
Si+",ture o 6,cu-t8 Si+",ture o HO*
SUGGESTE* OO3S
T1( 4Computer Graphics C version5, Donald *earn & . auline aker, earson ducation.T)( 4Computer Graphics - Principles & Practice5, )econd edition in $, 'oley, /andam, 'riner,
*ughes, earson ducation.
RE6ERENCES
R1( 4Computer Graphics, )econd edition, Donald *earn & . auline aker, *01 earsonducation
R):Computer Graphics Second edition, higand !iang, oy plastock, )chaum4s outlines Tata
c %ra hill education
R(Procedural Elements for Computer Graphics, David ' ogers, c-%ra*ill 0nternational, 00dition
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age "
8/13/2019 Computer Graphics III It Hb Updated
17/40
11.> Duestio" ,"ist the different graphical input devices. hat are the application areas of eachF
:. *o long ould it take to load a
8/13/2019 Computer Graphics III It Hb Updated
18/40
8/13/2019 Computer Graphics III It Hb Updated
19/40
2. *o can e counter visuali"ation and animationF
3. hat are possible applications of computer graphicsF
:. !plain about the relationship among the various security attacks and services.
;. @aA $ite e!amples from real life, here the folloing computer application objectives are needed( i. edical ii. #rt iii. $#D
)uggest suitable security mechanisms to achieve them.
@bA %ive a real life e!ample here the input device is needed and its application.
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age "/
8/13/2019 Computer Graphics III It Hb Updated
20/40
ii u"it
5. aA hat are the steps involved in the edge fill algorithm. G#pril1ay - 2852 I
bA Dra the flo chart for resenham4s ellipse generation algorithm.
2. aA !plain about the flood fill algorithm for filling polygons. G#pril1ay - 2852 I
bA rite an algorithm of resenham4s circle generation algorithm.
3. aA %enerate ellipse in first +uadrant using mid-point ellipse generating algorithm ith r!L;
and ryL3.@ellipse on originA G Cov 1Dec 2852IbA rite the algorithm for line generation using DD# approach. #nalysis its time and space
re+uirement
:. aA !plain the steps involved in the circle generating using the mid-point subdivisionalgorithmF G ay1june 2853I
bA !plain the scan line algorithm used for filling the polygon. hat data structures are used
init F
11.>.1.) Assi+"'e"t Duestio"s5. aA rite an algorithm of vector generation algorithm for line draingG#pril1ay - 2852 I
bA !plain the )can line polygon fill algorithm.
2. aA Describe the advantages of scan line fill method over the flood fill method. G#pril1ay -2852 I
bA Dra the flo chart for midpoint circle generation algorithm
11.>.1. Tutori,- Duestio"s
5. Derive the line ith end-points @28, 58A and @38,56A using DD# algorithm
2. Dra the circle ith radius ;, demonstrate midpoint circle algorithm by determining along ithradius along the octant in the first +uadrant from !L8 to !Ly.
11.>.1.1 Objective Duestio"s
5. hich of the folloing is true about the renham4s algorithmKKKKKKK G$I
aA There is only one division operationbA ounding operation is performed inside the loop
cA There are no intensive computations, e!cept multiplication by 2
dA )lope of the line is e!plicitly computed.
2. $omparing ith circle, ellipse generation re+uires more computation. this becauseKKKG$IaA $ircle is described by an e+uation
bA )hapes of the circle is regularcA 7rigin centered ellipse is not symmetrical !Ly a!is
dA #liasing problem is less in circle
3. 0f an algorithm uses the output of the pervious iteration , the computations of outputs in thecurrent iteration , such algorithms are called asKKKKKK GI
aA Double-differencing algorithm
bA 0ncremental algorithm
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #0
8/13/2019 Computer Graphics III It Hb Updated
21/40
cA )uccessive appro!imation algorithm
dA )can-line algorithm
:. 0n circle draing algorithm ,hen the circle is centered at an arbitrary point@!,y,cA,ho many
reflections are re+uiredKKKKKKKK G#IaA 3
bA 2
cA 5
dA :;. $ircle is not symmetrical aboutKKKKK G$I
aA !L-ybA yL8
cA yL!M5
dA !L8
ine draingA
5
8/13/2019 Computer Graphics III It Hb Updated
22/40
59. KKKKKKKKtable contain all the information necessary to process the scan lines efficiently
@sorted edgesA
56. KKKKKKKK is simply that the properties of one part of scene are related in some ay to other
parts of the scPne o that the relationship can be used to reduce processing.@coherenceA5=. # KKKKKKKKdefined as the set of points that are all at a given distance r from a center
position@!,yA.@circleA
28. KKKKKKK is an elongated circle @ellipseA.
NPTEL LIN3(
2tt&(;;"&te-.iit'.,c.i";vi#eo.&2&subjectI#F17@17@77
11.>.).?. LOOMS TAONAMY
, Re'e'beri"+ Leve- Duestio"s
5. Define the DD# algorithmF2. Define line segmentF >ist the different algorithmF
3. Define circle and >ist its algorithmF
:. Define ellipse and list it algorithmF
b U"#erst,"#i"+ Leve- Duestio"s
5. hat is difference beteen the DD# and resenham4s line draing algorithmF2. Differentiate circle and ellipseF3. !plain about various types polygon filling algorithmF
c A&&-8i"+ Leve- Duestio"s
5. !plain the derivation of circle algorithm & its applications.2. prove that DD# algorithm is more efficient than general slope of line yLm!Mc.
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age ##
http://nptel.iitm.ac.in/video.php?subjectId=106106090http://nptel.iitm.ac.in/video.php?subjectId=1061060908/13/2019 Computer Graphics III It Hb Updated
23/40
000 unit
5. aA Derive the scaling transformation matri!. #lso give scale factors to double the idth ith
reduction in its height by half of an object. G#pril1ay - 2852 IbA !plain about the shear and composite transformations.
2. aA rite the general form of a scaling matri! ith respect to a fi!ed point p@h,kA here the
scaling factors in ! and y directions are a and b respectively. G#pril1ay - 2852 IbA )ho ho shear transformations may be e!pressed in terms of rotation and scaling.
3. aA )ho that a rotation about the origin can be done by performing three shearing
Transformations G#pril1ay - 2852 I
bA hat is the need of homogeneous coordinatesF %ive the homogeneous coordinates for
translation, rotation and scaling.
:. aA 'ind the normali"ation transformation C hich uses the rectangle #@5,5A @;,3A $@:,;A
and D@8,3 as a indo and the normali"ed device screen as the vie port . G#pril1ay -2852 I
bA )ho that a rotation about the origin can be done by performing three shearingtransformations.
;. aA Derive the transformation for rotating an object by 38 degrees clockise about verte!
#@2,2A, @;,2A, $@;,;A an d D@2,;A. GCov 1Dec 2852IbA !plain the transformation can be performed beteen coordinate system
Assi+"'e"t Duestio"s
5. aA Derive the transformation matri! for performing the rotation about an originF Gay1Hune2853I
2. !plain the different 2D basic geometric tranfomationsF
TUTORIAL DUESTIONS5. erform a :; degree rotation of a triangle #@8,8A, @5,5A and $@8,5A about @-5,-5A.
2. 7btain the reflection of the point #@58,58A about yL!M2
11.>.1.1 Objective Duestio"s
5. 0f every point on the object is translated by the same amount ,such transformation is called
asKKKKKKKKKKKK G#I
aA rigid-bodybA transformation ith deformation
cA deformation in translation
dA tightly coupled transformation
2. if the s! and sy , are scaling factors applied in ! and y directions respectively , on @!,yA theoutput point coordinates after applying scaling operation isKKKKKKKK GDI
aA !5L51!s!,yLy.s!bA bA!5L!Ms!,y5LyMsy
cA !5L!.s!,y5L51y.sy
dA !5L!.s!,y5Ly.sy3. The reflection about !-a!is is given by matri!KKKKKKKKK G#I
aA 5 8 bA -5 8 cA -5 8 dA 8 5
8 -5 8 5 8 -5 5 8
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #3
8/13/2019 Computer Graphics III It Hb Updated
24/40
:. The reflection about y-a!is is given by matri!KKKKKKK GI
aA 5 8 bA -5 8 cA -5 8dA 8 5
8 -5 8 5 8 -5 5 8
;. The reflection about origin is given by matri!KKKKKKK G$I
aA 5 8 bA -5 8 cA -5 8 dA 8 5
8 -5 8 5 8 -5 5 8
8/13/2019 Computer Graphics III It Hb Updated
25/40
5A !plain the difference beteen scaling & translation.
2A Differentiate rotation and shearingF
3A !plain the *omogeneous coordinatesF
c A&&-8i"+ Leve- Duestio"s
5. rove that the multiplication matrices for each of the folloing se+uence of operations is
commutative
i. To successive rotations
ii. To successive translationsiii. To successive scalings.
2. @aA )ho that the composition of to rotations is additive by concatenating the matri!representations for
@R5A @R2A L @R5 M R2A
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #5
8/13/2019 Computer Graphics III It Hb Updated
26/40
0/ unit
5. aA !plain ho do e determiner hether in object is intersecting ith an indo edge,
using the )utherland *odgeman algorithmF Gay1Hune 2853IbA hat is the role of parametric function in the implementation of $yrus-eck algorithm
for the line clippingF G#pril1ay - 2852 I Gay1Hune 2853I
2. !plain $ohen-)utherland line clipping. rite don algorithm for it.GCov 1Dec 2852I
3. aA !plain about the midpoint subdivision line clipping algorithm. G#pril1ay - 2852 IbA Derive the indo to vieport transformations e+uations by first scaling the indo to
the si"e of the vie port and then translating the scaled indo to the vie port position.
:. 'ind the normali"ation transformation that maps a indo hose loer left corner is at@5,5A and upper right corner is at @3,;A ontoa vie port that is the entire normali"ed device
screen anda vie port that has the loer left corner at @8,8A and upper right corner
at@512,512A.
;. $ompute the transformation matri! that maps a indo ith@!min,!ma!AL@2,2Aand @!ma!,yma!A L@:,et be a rectangular indo hose loer left corner is at > @-3,5A and upper right- hand
corner is at @2,.1.1 Objective Duestio"s
5. # rectangular area ith its edges parallel to the a!is of CD$) is used to specify a sub-regionof the display area that embodies the image. This rectangular areas is called asKKKKKKK G$I
aA Cormali"ed device
bA hysical devicecA /ie-port
dA indo
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #
8/13/2019 Computer Graphics III It Hb Updated
27/40
2. hich of the folloing bits @from rightA is set to 5 in cohen-sutherland algorithm if
UminKK G#I
aA bit 3 bA bit 5 cA bit : dA bit 2
3. The logical #CD operation performed on the :-bit codes correspond to the end-points of theline segment consists same non-"eros, then the line segment isKKKKKK GI
aA artially visible or completely invisible
bA $ompletely invisible
cA artially visibledA $ompletely visible
:. The dot product of to vectors is positive then the angle beteen those to vectors isdefined in the range of KKKKKKK G$I
aA 8UQU=8
bA =8U QU298
cA 8UQU=8 & =8U QU298dA 8U QU568
;. The dimensions of normali"ed space in vieing transformation are KKKKKKK GDI
aA
8/13/2019 Computer Graphics III It Hb Updated
28/40
28. #ny procedure that identifies those portions of a picture that are either inside or outside
of a specified region of space is referred to as aKKKKKKK algorithm. @clippingA
NPTEL LIN3(
2tt&(;;"&te-.iit'.,c.i";vi#eo.&2&subjectI#F17@17@77
LOOMS TAONAMY
, Re'e'beri"+ Leve- Duestio"s
5. Describe the indoF2. Define vieportF
3. Define clippingF:. hat are the line clipping algorithmsF
b U"#erst,"#i"+ Leve- Duestio"s
5A !plain the difference beteen indo & vieport.
2A Differentiate beteen line clipping and polygon clippingF3A !plain the :-bit region codeF
c A&&-8i"+ Leve- Duestio"s
5. )ho that a line intersection point if the line is partially passing through the indo2. !plain the )utherland-*odgeman polygon clipping algorithm ith an e!ampleF
/ Vnit5. aA !plain the properties and design techni+ues of e"ier curve. G#pril1ay - 2852 I
bA !plain about the phong shading model.
2. aADerive the transformation illumination model that combine diffuse and specular
reflection. G#pril1ay - 2852I
bA Differentiate beteen e"ier curve and -)pline curve.
3. aA Derive the transformation matri! for *ermite curve. G#pril1ay - 2852 I
bA Describe the characteristics of the folloing parameters.
aA Diffuse eflectionbA )pecular eflection
cA efraction.
dA:. aA !plain %ouraud shading. *o does it create smooth shadingF G#pril1ay - 2852 I
bA !plain about the % color model.
;. aA !plain fast phong shading.G Cov1Dec 2852IbA hat are e"ier curvesF !plain cubic e"ier curves.
11.>.1.) Assi+"'e"t Duestio"s
5. hat is the blending function for the -)pline curveF Define each term in it. hat are the
characteristics of -)pline curveF Gay1Hune 2853I2. !plain ho is -)pline curve algorithm can be e!tended to the generation of -)pline
surfaceF
TUTORIAL DUESTIONS
5. hat is the blending function used in e"ier4s method for curve generationF!plain the terms
involved in itFhat are the properties of e"ier curveF
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age #.
http://nptel.iitm.ac.in/video.php?subjectId=106106090http://nptel.iitm.ac.in/video.php?subjectId=1061060908/13/2019 Computer Graphics III It Hb Updated
29/40
2. Different types of -)pline curves
11.>.1.1 Objective Duestio"s
5. KKKKKKKK is the polynomial ith ma!imum poer 3 G#I
aA $ubic polynomialbA ?uadric polynomial
cA inomial polynomial
dA #cute polynomial
2. # polynomial curve using a parameter called asKKKKKKKKKK G#IaA arametric polynomial curve
bA $ubic polynomial curvecA ?uadric polynomial curve
dA )olid polynomial curve
3. # set connected polygon ally bounded planar surface is called asKKKKKKKK G#I
aA olygon meshbA )olid object
cA 3D object
dA esh-cube:. KKKK is not a common represented of 3D surface GDI
aA olygon surfacebA arametric surfacecA ?uadratic surface
dA Ceural surface
;. The KKKKKKKsurfaces are defined on a plane, then the lanes normal is computed as. G$IaA $ubic surface
bA i-cubic surface
cA ?uadratic surface
dA inomial surface
8/13/2019 Computer Graphics III It Hb Updated
30/40
55. 0n the folloing curves, KKKKKKKcurves re+uire, for its definition to end points & to end
point tangent vectors@*ermit curveA
52. 0n the -splines algorithm, the stands forKKKKKKKKK @asisA
53. The range of parametric variableWt4 used in e"ier curve isKKKKKKKKK @8, 5, dA5:. The KKKKK light has no spatial or directional characteristics. @#mbientA
5;. The KKKKK model sets the intensity of specular reflection proportional to cosine. @hongA
5.?.?. LOOMS TAONAMY
, Re'e'beri"+ Leve- Duestio"s5. Describe the polygon surface.2. hat are the properties of )pline curveF
3. Define the spline.:. Discuss the advantages of hong model
b U"#erst,"#i"+ Leve- Duestio"s
5. !plain the asic illumination modelsF
2.!plain the purpose of *ermit curve and ho is it performed.
c A&&-8i"+ Leve- Duestio"s
5. !plain about the different forms of polygon rendering methodsF2. Dra the e"ier $urves F 0ts applications.
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 30
http://nptel.iitm.ac.in/video.php?subjectId=106106090http://nptel.iitm.ac.in/video.php?subjectId=1061060908/13/2019 Computer Graphics III It Hb Updated
31/40
/0 Vnit
5. aA )tate the matri! representation for mirror reflection in 3D transformation. 0n all different
principal plains. GCov1dec 2852IbA !plain about the vieing pipelineF
2. aA Derive the transformation matri! for rotation about an !-a!is in 3D.G#pril1ay B 2852I
bA $ompare the orthographic and obli+ue types of parallel projections
3. aA !plain the various clipping parameters in 3D clipping. G#pril1ay - 2852 IbA Describe about the 3D vieing pipeline.
:. %iven a unit cube ith one corner at @8, 8, 8A and the opposite corner at @5, 5,5A, derive the
transformations necessary to rotate the cube by R degrees about the main diagonal from @8, 8,
8A to @5, 5, 5A in the counter clock-ise direction hen looking along the diagonal toard theorigin
;. aA Derive the transformation matri! to rotate a 3-dimentional object about an arbitrary a!is
ith an angle X. G#pril1ay - 2852 I
11.>.1.) Assi+"'e"t Duestio"s
5. !plain the various kinds of orthographic parallel projections. . G#pril1ay - 2852 I
2. Derive the perspective projection transformation matri!. G#pril1ay - 2852 I
TUTORIAL DUESTIONS
5. 'ind the transformation matri! hich align the vector /LiMjMk ith the vector CL2i-j-k.
2. # pyramid defined by the coordinates #@8, 8, 8A, @5, 8, 8A, $@8, 5, 8A and D@8, 8, 5A is rotated :;8
about the line > that has the direction /LHME and passing through point $@8, 5, 8A. 'ind thecoordinates of rotated figure
Objective Duestio"s
5. 0n 3D scaling transformation for transition ith a unit along !-a!is & b units along y-a!is &c units along "-a!is isKKKKKKKKKKKKKK GI
aA5 8 8 8bA5 8 8 8cA a b c 5 dA none
8 5 8 8 8 5 8 8 8 8 8 5 8 8 5 8 8 8 5 8 8 8 5 8
-a b 8 5 a b c 5 5 5 5 5
2. 0f the a!is of rotation is N ,then the direction of positive rotation is KKKKKKKKKK G#I
aAy to "bA " to !
cA ! to y
dA y to !
3. 0f the a!is of rotation is ,then the direction of positive rotation isKKKKKKK GIaAy to "
bA " to !cA ! to y
dA y to !
:. 0f the a!is of rotation is ,then the direction of positive rotation isKKKKKKKK G$IaAy to "
bA " to !
cA ! to y
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 3"
8/13/2019 Computer Graphics III It Hb Updated
32/40
dA y to !
;. 0n 3D space rotation of an object is done aboutKKKKKKKKK GI
aA a point
bA an a!iscA a plane
dA a hyper plain
8/13/2019 Computer Graphics III It Hb Updated
33/40
. NPTEL LIN3(
2tt&(;;"&te-.iit'.,c.i";vi#eo.&2&subjectI#F17@17@77
11.>.@.?. LOOMS TAONAMY
, Re'e'beri"+ Leve- Duestio"s
5. >istthe 3D asic transformations.
2. Discuss the 3D rotationF3. Define shearingF
:. Define projectionF
b U"#erst,"#i"+ Leve- Duestio"s
5. !plain the different 3D reflections.
2. !plain the scaling about fi!ed point.
3. Differentiate the projectionsF
c A&&-8i"+ Leve- Duestio"s
5. rove that the multiplication matrices about a particular plane for each of the folloing se+uenceof operations is commutative
i. To successive rotationsii. To successive translations
iii. To successive scaling.
2. !plain about the vieing pipelineF
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 33
http://nptel.iitm.ac.in/video.php?subjectId=106106090http://nptel.iitm.ac.in/video.php?subjectId=1061060908/13/2019 Computer Graphics III It Hb Updated
34/40
/00 Vnit
5. aA hat is the principal folloed in area-subdivision algorithm used for the visible surfacedetectionF Gay1Hune 2853I
bA %iven a brief note about octree data structure. *o is it useful for the hidden surface
removalF
2. aA !plain ho area sub-division algorithm orks for visible detectionF GCov 1Dec 2852I
bA !plain hidden surface removal using depth sorting algorithmF
3. aA !plain the painter4s algorithm in detail. !plain the situation here the painter4s
algorithm does not ork properly. G#pril1ay - 2852IbA $ompare the ray casting method ith - buffer method.
:. #ssuming that one allos 22: depth value levels to be used, ho much memory ould a582: Y 9
8/13/2019 Computer Graphics III It Hb Updated
35/40
cA )peed-up the process& increase the precision
dA Cone
3. The e+uation of polygon surface is #!MyM$"MDL8. !amining of hich coefficient is
sufficient to determine the visibility of polygon surface GcIaA #
bA
cA $
dA D:. #nother name for depth-buffer method for visible surface GaI
aA "-buffer algorithmbA Depth-sorting algorithm
cA scan-line algorithm
dA ainters algorithm
;. 0n -uffer algorithm , the -uffer stores the value of GbIaA Depth
bA 0ntensity
cA Depth & 0ntensitydA 0ntensity & interaction number
ist-priority
cA Depth-)ort
dA inary space algorithm9. 0n hich of the folloing algorithm the polygons in the scene are grouped into clusterGbI
aA>ist priority algorithm
bA ) tree algorithm
cA )can-line algorithmdA-uffer algorithm
6. 0n hich of the folloing algorithm, is ell suited hen the vie point changes GbI
aA>ist priority algorithmbA ) tree algorithm
cA )can-line algorithm
dA-uffer algorithm=. The correct priority order polygon list can be obtained using KKKKin ) tree GaI
aA in order tree alk
bA re-order tree alk
cA ost-7rder tree alkdA ') tree alk
58. *o many buffers are used in -uffer algorithm GbI
aA 5 bA 2 cA3 dA :
55. # method compares object & parts of object to each other ithin the scene definition to
determine hich surfaces, as a hole, should be labeled as visible.KKKKKKK@7bject spaceA52. 0n KKKKKKKK visibility is decided point by point at each pi!el position on the projection plane.
@0mage spaceA
53. The area-subdivision algorithm as developed by KKKKKKKKK@arnockA5:. ainter4s algorithm is also knos as KKKKKKKKKK@Depth sorting algorithmA
5;. Cumber of buffers used in -uffer algorithm KKKKKKKKK@2A
5
8/13/2019 Computer Graphics III It Hb Updated
36/40
59. The correct priority order polygon list can be obtained using KKKKin ) tree.@0n-order treeA
56. 0n KKKKKK algorithm, the object surfaces need not be polygons. @-ufferA
5=. The KKKKKKKK is particularly useful hen the vie reference point changes, but the object in
a scene are at fi!ed positions. @) TreeA28. 0n KKKKKKKKmethod uses both the image space & object space techni+ues.@Depth sortingA
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 3
8/13/2019 Computer Graphics III It Hb Updated
37/40
11.>..>. NPTEL LIN3(
2tt&(;;"&te-.iit'.,c.i";vi#eo.&2&subjectI#F17@17@77
11.>..?. LOOMS TAONAMY
, Re'e'beri"+ Leve- Duestio"s
5. hat is an image spaceF2. Define an object spaceF
3. Define an depth-bufferF:. >ist visible surface algorithmsF
b U"#erst,"#i"+ Leve- Duestio"s
5. $ompare and contrast beteen the object space and image spaceF
2. !plain the back face detection method.
3. !plain briefly scan line conversion method.
c A&&-8i"+ Leve- Duestio"s
5. !plain about the painter algorithm
2. )ho that depth-sorting is both the image space and object space methodF
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 3-
http://nptel.iitm.ac.in/video.php?subjectId=106106090http://nptel.iitm.ac.in/video.php?subjectId=1061060908/13/2019 Computer Graphics III It Hb Updated
38/40
/000 Vnit
5. aA hat are the issues hich are to be considered for designing an animation se+uenceF
Gay1Hune 2853IbA riefly e!plain about the motion specificationF
2. aA hat is morphingF !plain various issues to be considered in morphingF GCov 1Dec 2852I
bA Describe the Eey-frame systemF
3. aA !plain the design of animation se+uences. G#pril1ay - 2852 IbA Discuss about the techni+ues to achieve the simple animation effects.
:. aA hat are the steps in animationF G#pril1ay - 2852 I
bA !plain in detail about the Eey frame systems.
;. aA Describe about the orphing. G#pril1ay - 2852 I
bA Describe the techni+ues to achieve the simple animation effects.
11.>.1.) Assi+"'e"t Duestio"s
5. hat is morphingF *o is a shape converted into another shape by morphingF
2. !plain about the computer animation languages.
TUTORIAL DUESTIONS
5. hat are the various types of interpolation used in animation
2.The typical tasks for hich the animation function are defined in animation languages
Objective Duestio"s
5. #pplication of computer-generated animation are GdI
aA #dvertising
bA )cientificcA Training
dA #ll the above
2. any applications of computer animation re+uire KKKKKdisplay GcIaA andom
bA egular
cA ealistic
dA otive3. KKKKdefine the motion se+uence as a set of basic events that are to take placeGbI
aA #ction
bA )toryboard
cA 'ramedA Cone
:. 'ilms re+uires KKKKframes per second GbIaA 3:
bA 2:
cA 23dA 2;
;. ithin each frame, each object is positioned according to the KKKfor that frame GaI
aA Time
MLR Institute of Technology, Dundigal, Hyderabad 500 043 !age 3.
8/13/2019 Computer Graphics III It Hb Updated
39/40
bA )hape
cA )i"e
dA 7rientation
8/13/2019 Computer Graphics III It Hb Updated
40/40
b U"#erst,"#i"+ Leve- Duestio"s
5. !plain about the different types of animation languagesF
2. Differentiate key-frame systemF
c A&&-8i"+ Leve- Duestio"s
5. *o the conventional animation is different from computer animationF
2. *o the motion specification can be achievedF
Recommended