Tuesday, December 14, 2010

Computer Graphics - 5


Q-1 State whether the following statements are true or false (Justify).                                                         2
1.      The transformation in which the shape appears as if the object were composed internal layers that had been caused to slide over each other is called shear.
2.      The technique of replacing a specified interior color of an area instead of searching for its boundary colour is known as flood fill.
3.      Picture definition is stored as line drawing command in Raster Displays.
4.      The initial value of the midpoint circle decision parameter is (4/4) –r.

Q-2      a. Explain Raster-Scan Displays.                                                                                                        2 ½
            b. Explain Random-Scan Displays.                                                                                                    2 ½
            c. Explain Shadow-mask method used in color CRT monitors.                                                         2
            d. What are composite monitors?                                                                                                       1

Q-3      Explain Midpoint Circle Generating Algorithm with one example.                                                   3

Q-4      Explain Reflection and Shear.                                                                                                                        4
OR
Q-4      The vertices of a triangle ABC are A(2,0), B(12,0) and C(2,10) the triangle is scaled with respect to
fixed point (2,0) by factors x=2 and y=0.5 then triangle is rotated about by 60 degree.
Calculate the vertices of transformed triangle.

Q-5      a. Explain Cohen Sutherland outcode algorithm for clipping lines.                                                   3
b. Let the window have its lower corner at (-2,-1) and its upper right corner at (3,2). For the following
    two line segments state whether it will be totally visible, totally hidden, partially visible segments   
    and for partially visible segments give coordinates at which it is clipped.                                     2
i.                    (-3,1) to (4,1)
ii.                  (-2,3) to (1.4)

Q-6      Explain with suitable example. How liang-Barsky Line clipping Algorithm is more efficient than the Cohen-Sutherland Line clipping algorithm.                                                                                       3