Computer Graphic (CG) Semester 4 (Revised Course) (3 Hours) December 2013

Computer Graphic (CG) Semester 4 (Revised Course) (3 Hours) December 2013
LJ-10531 [Total Marks : 100]
N.B:	(1)	Questions no 1 is compulsory.
	(2)	Attempt any four questions out of the remaining six questions.
	(3)	Assume suitable data if necessary and justify the same.
	(4)	Figures to the right indicate full marks.
1.	(a)	Explain character generation methods.	05
	(b)	Explain inside outside test used in filling algorithm.	05
	(c)	What is antialiasing, how can it be reduced.	05
	(d)	Explain Z-buffer algorithm for removing hidden surfaces.	05
2.	(a)	Explain flood algorithm using 8-connected approach. Give its advantages and disadvantages.	10
	(b)	Derive Bresenham's line drawing algorithm. Plot a line by using Bresenham's line generation algorithm from (1, 1) to (5, 3).	10
3.	(a)	Translate the square ABCD whose co-ordinate are A(0, 0), B(3, 0), C(3, 3) and D (0, 3) by 2  units in both direction and then scale it by 1.5 units in x-direction and 0.5 units in y-direction.	10
	(b)	List and explain operations on segments.	10
4.	(a)	Find the clipping co-ordinate to clip the line segment AB against the window using cohen-sutherland line clipping algorithm. Line - A (120, 60), B (160, 92) Xwmin = 100     Ywmin = 80 Xwmax = 150    Ywmax = 100	10
	(b)	Expalin Warnock's algorithm.	10
5.	(a)	State important properties of Bezier curve. Compare Bezier curves and B-spline curve.	10
	(b)	Explain parallel and perspective projection? Derive the matrix for perspective projection.	10
6.	(a)	Explain 3D object representation methods.	10
	(b)	Define the window, view port and derive window to viewport transformation.	10
7.	Write short notes on :-		20
	(a)	Colour Models
	(b)	Raster techniques
	(c)	Display file interpreter
	(d)	Fractals
	(e)	3D clipping.