COMPUTER GRAPHIC

BASIC              

UTTARAKHAND TECHNICAL UNIVERSITY

B.TECH FIRST YEAR, 2012
COMPUTER GRAPHICs


time : 3hr
Total marks :100

1. Attempt any two of the following :
(a) Lisf and explain some applications for largescreen
displays.
(b) Define the following terms :
(i) Primitive devices
(ii) Display file structure
(iii) Display control text.
(c) Set up a parallel version of Bresenham's
algorithm for straight lines of any slope.


2. Attempt any two of the following : l0x2

(a) Discuss various methods of storing the edge list
and their relative merits for pattern filling.
l0x2=20

(b) Explain the followirig :
(i) Segments
(ii) SegmenTt able
(iii) Creating, deleting and renaming segments.
(c) Write a procedure to compute the elements of
the matrix for transforming object descriptions
from one Cartesian coordinate syst€m to another.
The second coordinate syst€lll is to be defined
with an origin point Po and a vector V that
gives the direction for the positive y' axis of
this system.

3.  Attempt any two of the following : l0x2=20
(a) _ Prove the assertion that the transformation of a
line between two points A and B is equivalent
to the line between the transform of A and the
transform of B. Consider only the translation,
rotation, and scaling transformations.
(b) Find out the sequence of basic transformations
which are equivalent to y-direction shearing.
(c) Explain multiple windowing in detail.
4 Attempt any two of the following : 10x2:20
(a) What is the necessityf or 3-D clipping algorithm?
Explain any one 3-D clipping algorithm.
' (b) Explain event handling echoing.
(c) Derive the 3-D transformationm atrix for
reflecting a point about a plane.


5 Attempt any two of the following : l0x2:20

(a) Explain scan line algorithm for hidden surface
removal
(b) Discusst he propertieso f the Bezier and B-spline
curves.
(c) Explain Rendering and Illumination