Computer Graphic (CG) Semester 4 (Revised Course) (3 Hours) May 2010

Computer Graphic (CG) Semester 4 (Revised Course) (3 Hours) May 2010
AN-3448 [Total Marks : 100]
N.B:	(1)	Questions no 1 is compulsory.
	(2)	Solve any four from remaining i.e. Q. 2 to Q. 7.
	(3)	Figures to the right indicate full marks.
1.	(a)	Derive decision parameters for the midpoint ellipse algorithm (Region 1), assuming the starting position is (O, ry) and points are to be generated along the curve path in clockwise order and hence solve rx = 4, ry = 3.	10
	(b)	Draw 3D transformation pipeline from modeling co-ordinates to final device co-ordinates of hence derive transformation from world co-ordinates to viewing co-ordinates.	10
2.	(a)	Write a boundary fill procedure to fill an 8-connected region.	05
	(b)	Show transformation matrix for reflection about line y=-x is equivalent to reflection relative to y - axis followed by a counterclockwise pure rotation.	05
	(c)	Write about the character generation methods.	05
	(d)	Show that composition of two rotations is additive by concatenating matrix.	05
3.	(a)	Explain cohen-Sutherland line clipping algorithm.	10
	(b)	Explain how Weiler-Atherton algorithm works for convex polygons? Clip the following polygon using the above	10
4.	(a)	Discuss the segment table along with operations on segments. What are the other display file structures used?	10
	(b)	Solve using Liang barsky line clipping algorithm, where (xwmin' xwmax) = 1,9 and (ywmin' ywmax)= (2,8) for line Segments      P1 (3,7) to P2 (3,10)                     P3 (6,6) to P4 (8,9)                     P5 (1,7) to P6 (11,1)	10
5.	(a)	Derive all the necessary matrices required to perform 3D Rotation about arbitary axis.	10
	(b)	Write short notes on Text Clipping Methods.	05
	(c)	Differentiate Parallel and perspective Projection.	05
6.	(a)	What is 3D clipping Derive equations for all the planes. (left, right, top, bottom, front, back).	10
	(b)	Explain Sutherland Hodgeman polygon clipping algorithm.	10
7.	Write short notes on :-		20
	(a)	Warnock's algorithm
	(b)	Depth Buffer algorithm
	(c)	Shading algorithms
	(d)	B-Spline and Bezier Curves.