Computer Graphic (CG) Semester 4 (3 Hours) December 2009

Computer Graphic (CG) Semester 4 (3 Hours) December 2009
SP-8048 [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 Mid Point Circle Algorithm; Hence state the algorithm.	10
	(b)	Explain inside-outside Tests.	05
	(c)	Explain Direct View Storage Tubes.	05
2.	(a)	Write a pseudo-code procedure to implement boundary-fill and flood-fill algorithm using the 4-connected definition for region pixels.	05
	(b)	Express window to viewport mapping in the form of composite transformation matrix. Also find complete viewing transformation that maps a window in world co-ordinates with x and y extent 1 to 10 onto a viewport with x extent 1/4 to 3/4 and y extent 0 to 1/2 in normalized device space, and then maps a workstation window with x extent 1/4 to 1/2 and y extent 1/4 to 1/2 in the normalized device space into a workstation viewport with x extent 1 to 10 and y extent 1 to 10 on the physical display device.	15
3.	(a)	Explain Cohen-Sutherland line clipping technique.	10
	(b)	Explain Liang-Barsky line clipping technique.	10
4.	(a)	What do you understand by the terms parallel and perspective projection? Also explain depth cueing.	10
	(b)	Explain all 3-D transformations along with matrix representations.	10
5.	(a)	Explain DDA algorithm. Solve (1, 1) to (5, 3) using DDA algorithm.	05
	(b)	Solve using Bresenham's line drawing algorithm (20, 10) to (30, 18).	05
	(c)	Explain the two techniques for producing color displays with CRT.	10
6.	(a)	Write Mid-Point Ellipse Algorithm Solve rx = 8 and ry = 6.	10
	(b)	Explain Goroud Shading & Phong Shading.	10
7.	Write short notes on the following any four :-		20
	(a)	Z-Buffer Method
	(b)	Scanline Method
	(c)	Area Subdivision method
	(d)	Properties of B-spline Curves.