Q-1. Attempt the following:
a) What is Digital Differential Analyzer? How Bresenham’s line drawing algorithm is more efficient than DDA? Explain Bresenham's algorithm for the line with slope |M| >=1.
b) Explain nonzero winding number for determining whether a point is inside the polygon or not. In which situation it may field different results from that of even-odd method?
c) Derive and Write Bresenham’s Mid-Point Circle generation algorithm and trace it for the circle (x-3)2+(y-1)2 =100
Q-2. Explain Following terms:
1) Pixel
2) Resolution
3) LED
4) Flat Panel Display
OR
Q-2. Explain various input/output devices used in computer graphics system.
Q-3. (1) Briefly describe the line attributes: line type, line join.
(2) Suppose you have a system with an 8-inch by 10-inch video screen that can display 100 pixel per inch. If a color lookup table with 64 positions is used with this system, what is the smallest possible size (in byte) for the frame buffer?
Q-4. Shows that, transformation matrix for a reflection about line y=x is equivalent to a reflection relative to the X-axis followed by a counter clockwise rotation of 90 Degree.
Q-5. Explain Reflection and Shear.
OR
Q-5. 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-6.
(1) Explain with suitable example, How Liang-Barsky Line Clipping Algorithm is more efficient than the Cohen-Sutherland Line Clipping Algorithm.
(2) Use Cohen-Sutherland algorithm to explain the clipping procedure of the line with end points A(-2,-2) and B(2,2) and the Clipping rectangle as shown in the following figure:
