7/28/2019 95186 21017 Computer Applications in Design

1/3

Reg. No. :

QuestionPaper Code 2002INI.E./M.Tech.DEGREE EXAMINATION, JANUARY 2011.

First SernesterComputer Aided Desig n

(Common o CAD/CAM, Engine ering Design and Product Design and Developrnent)218101 COMPUTER APPLICATIONS IN DESIGN

(Regulat ion 010)Time : Thlee hor.rls Maximurn : 10 0marks

Answer ALL questions.P A R T A - ( 1 0 x 2 = 2 O m a r k s )

l . r \ Picture is to be t lanslatecl h lough 10 ancl 15 t rn i t , " n \ anr l \ - r l i r ' .c t r . rnslespectively.Write the matrix in homogeneous o-ordir.ratesbl t lanslation.2. Expla insheart ransi i l ' rnat ion.3. What , isperrspect ivt - 'p lo ject ion?Explarn.4. (i ive the conceptof polygon ables.5. I)e-"rlr' ibe nion. intersection and dif{'erenceolrerat, ion n r:onstluct, ivesolidgeometr')' nethods.6. Expla in the concepts f a l iasi r - rgnd ant ia l iasing.7 What are the considerations to be taken cale before beginning cleat,ing anassembly of the CAD model?8. State the differencesbetweenparametric and variational modeling schemes.9. Write sholt notes on the properties of composite objects vith regard to massploperty calcr.rlations.10. Explain the Rubber banding and dragging techniques with regard to graphic

aids.

c''4 I ,l 7 4

7/28/2019 95186 21017 Computer Applications in Design

2/3

l l

I '

L ) _

(a )PART B - (5 x 16 = 80 rnarks)

(t Explain the Cohen-Sutherlandalgorithm for f inding the categoryofa l ine segment Show clearly horv each category is handled by thealgorithm. (8)

(i i) Write an algorithm fo r generating the intelmediate points usingBresenham's line algorithm rvhen two end points are grven asrnput . (8)Or'

(b) Give 3 x 3 homogeneous-coordinate ransfonnation rnatrix which n'ri lhave the same effect as eachof the following trar.rsfolmation echniqur:s(r ) Scale the image to be twice as lai'se ancl then rotate counter'-c lochwise y 90 degrees bout the ougrn (8)

( r )

Rotate clockrvise bout the or igrn br , . t5 degreesand then scl i le hey-di rect ion o be one- l . ra l f s la t 'ge. (3)Expla in the data st luctu i 'e usecl r . r lSG :rnclB rcp sol ic l noclehngt echn i ques . (6 )

( i i ) Wi th sui table examples expla in how sol id model are generatedusing Booleanoper:ation. (4 )( i i i ) What ai 'e the crotnt .uonnot lc l ins nrcthor ls avai la l r l r ' fo l sul fhce

des ign in a sur face ntode l ing so l ts ale ' . ' l t r )Or'

The t ;ool r l inales f ' four l rorntsale given bv I ] , (2,2) . ] (2.3) . I , . . (3,3) ndPr(3.2) . r ind the eqnat ion o1' the B-spl ine cutve def ined b1' the cont r .o lpo rn t s 2 , 2 ) , 2 . 156 , . 563 ) .Q.5 , 2 . 75 ) . 2 . 8114 . 2 . 5363 )nd (3 , 2 ) . (16 )(r ) Comyrale he techniquesof Phor.rg hading anclGar,rraud hading.(4 )(i i) Describe an algolithm for lernoval of ' hidden lines. Also rl iustratewith an e xample hor,vhe algorithm can be implemented. (12)

Oi 'i lxplain ih e follorving(i ) the z - Buffer algorithm for hidden sulface removal technique.(i i) Ra y - Tracing Algorithm for hidden solid removal.

(i i)

( b )

( 4 ,

(b)(8 )(8 )

20027

7/28/2019 95186 21017 Computer Applications in Design

3/3