ECS-504/ Page 1 of 3

Anita Pal,A.K.Gahalaut

SHRI RAMSWAROOP MEMORIAL COLLEGE OF ENGG. & MANAGEMENT




B.Tech.
SEM V (CS) MID SEMESTER EXAMINATION, 2011-12
COMPUTER GRAPHICS
(ECS-504)



Note: Attempt All Questions.

Question 1 Attempt any four parts of the following: [3 X 4 = 12]

(a) Consider the line from (5,5) to (13,9). Rasterizing the line with the general
Bresenham algorithm. [3]

(b) Describe the construction and functioning of Beam Penetration CRT. Discuss
its merits and demerits. [2+1]

(c) Suppose we have a computer with 16 bits per word and a transfer rate of 1
mip(one million instructions per second).How long would it take to fill the
frame buffer of a 400 dpi (dot per inch) laser printer with a page size of 8.5
inches by 11 inches? [3]

(d) Differentiate between the Random scan display and Raster scan display.
Explain the role of pixel and frame buffer in graphics devices. [1.5+1.5]

(e) Explain incremental algorithm over DDA with suitable example. [3]

(f)Write a procedure for a parallel implementation of circle algorithm. [3]


Question 2 Attempt any two parts of the following: [6 X 2 = 12]


(a) What is window to-view point coordinate transformation? What are issues
related to multiple windowing? [3+3]

F:/Academic/22
Refer/WI/ACAD/10
Time: 2 Hours Max. Marks: 50
(Following Paper-ID and Roll No. to be filled by the student in the Answer Book)

PAPER ID: Roll No.




ECS-504/ Page 2 of 3
Anita Pal,A.K.Gahalaut
(b) What are homogeneous coordinates? If a line whose end points are (x
1
,y
1
)
and (x
2
,y
2
) exists in 2D space, then write the concatenation of matrices that
will rotate the mirror image of the line about mid-point of the line by an
angle 60
0
counterclockwise. Each of the transformations has to be in
homogenous coordinate system. [2+2+2]

(c) What do you understand by the term Clipping? Explain the Cohen-
Sutherland algorithm for clipping a line and discuss how the Weiler-
Atherton algorithm worked for clipping. [2+2+2]


Question 3 Attempt any two parts of the following: [6.5 X 2 = 13]

(a)Do you think that the line clipping algorithm will do for polygon
clipping too? Justify your answer and explain Liang-Barsky algorithm
for 3D clipping. [3+3.5]

(b) What do you understand by the term Projection? Describe the one-
principal-vanishing-point perspective, two-principal-vanishing-point
perspective and three-principal-vanishing-point perspective . [3.5+3]

(c)Prove that the multiplication of the 3D transformation matrices for each
of the following sequence of operations is commutative: [2+2+2.5]

(i)Any two successive translations.

(ii) Any two successive scaling operations.

(iii) Any two successive rotations about any one of the coordinate axes.


Question 4 Attempt any two parts of the following: [6.5 X 2 = 13]

(a)What do you understand by the term Back-Face Removal? Compare
the Back-Face Removal with A-Buffer method. [3+3.5]

(b)Explain the Painters algorithm. Show how the calculation of the edge
with a scan line can be made incremental as opposed to absolute.
[3+3.5]





ECS-504/ Page 3 of 3
Anita Pal,A.K.Gahalaut
(c)Let P
0
(0,0), P
1
(1,2), P
2
(2,1), P
3
(3,-1), P
4
(4,10) and P
5
(5,5)be given data
points. If interpolation based on cubic B-splines is used to find a curve
interpolating these data points, find a knot set t
0
,..,t
9
that can be
used to define the cubic B-splines. Explain the difference between the
Bezier and B-spline curves. [2+4.5]



__________X__________





















ECS-504/
Anita Pal, A.K.Gahalaut



SHRI RAMSWAROOP MEMORIAL COLLEGE OF ENGG. & MANAGEMENT

B.Tech.
SEM V (CS) MID SEMESTER EXAMINATION, 2011-12
COMPUTER GRAPHICS
(ECS-504)

Question 1
(a) x=5,y=5,x=8,y=4,m=1/2, it will draw a straight line and points are (5,5),(6,6),(7,6),(8,7),(9,7),(10,8),(11,8),(12,9),(13,9) [3]
(b) The primary components of an electron gun in a CRT are the heated metal cathode and a control grid A beam of electrons
(cathode rays) emitted by an electron gun, passes through focusing and deflection systems that direct the beam toward specified
positions on the phosphor-coated screen. Merits and demerits are an inexpensive technique to produce color in random scan
monitor, display only 4colors,and quality of picture produced is not good as compare to other. [2+1]
(c)frame buffer=1496000(1 d=nbits),transferrate=16*10
6
bits/sec,Buffer=0.935n sec, t(8)=7.48sec. [3]
(d)Raster displays have 1)less resolution.2)the lines produced are ziz-zag 3)high degree realism is achived in picture.
4)decreasing memory costs 5) electron beam is swept across the screen, one row at a time from top to bottom. 6) Refreshing rate
of 60 to 80 frames/second. Random displays 1) have high resolutions since the picture definition is stored as a set of line drawing
commands and not as a set of intensity values. 2)smooth lines. 3)realism is difficult to achieve. 4) costlier. 5) electron beam
directly only to the parts of the screen where a picture is to be drawn. Picture definition is stored in a memory area called the
refresh buffer/frame buffer. [1.5+1.5]
(e)Incremental DDA -generates lines from their differential equations. It is important that DDAs can also be used to generate arcs
and other curves. For ex. Generate a line from point (0,0) to (4,3) using the symmetrical DDA. [3]
(f)we divide the line with dividing the x range to n segments. x
p
=(x+n
p
-1)/n
p
for mid point(x
k+1
,y
k+1/2
)
P
k+1
=p
k
+2y
p
+2x
p
(y
k+1
+y
k
). [3]
Question2
(a)A world-coordinate area selected for display is called a window. An area on a display device to which a window is mapped is
called a viewport Often, windows and viewports are rectangles in standard position, with the rectangle edges parallel to the
coordinate axes. The mapping of a part of a world-coordinate scene to device coordinates is referred to as a viewing
transformation. [3+3]
(b)The homogeneous coordinates of a nonhomogeneous positive vector [x y] are [x y h] where x=x/h and y=y/hand h is any
real number. The general transformation matrix is now 3x3 . Putting the value of in the given eq. [2+2+2]

(c) Those portions of a picture that are either inside or outside of a specified region of space is referred to as a clipping algorithm,
or simply clipping. The region against which an object is to clipped is called a clip window. Weiler- Atherton algorithm work for
subject and clipped polygon, it is specially used for polygon clipping. [2+2+2]
Question3
(a)Yes ,they clip line or polygon from left ,right ,bottom and top . Write Liang-Barsky algorithm for 3D clipping. [3+3.5]
(b)A projection is the transformation of points and lines in one plane onto another plane by connecting corresponding points on
the two planes with parallel lines. projection plane is perpendicular to one principal axes, projection plane is perpendicular to two
principal axes, projection plane is perpendicular to three principal axes. [3.5+3]
(c)Two matrix operations M1 and M2are commutative if M1.M2=M2.M1 Rotation ,scaling and translation are perform in
commutative M1.M2=M2.M1. [2+2+2.5]
Question 4
(a)A simple object space algorithm is Back-Face removal (or back face cull) where no faces on the back of the object are
displayed. Since in general about half of the faces of objects are are back faces this algorithm will remove about half of the total
polygons in the image. C=0,C0,C0.Its not easy to implement. An extension of the ideas in the depth-buffer method is the A-
buffer method (at the other end of the alphabet from "z-buffer", where z represents depth). The A-buffer method represents an
antialiased, area-averaged, accumulation-buffer method developed by Lucas film for implementation in the surface-rendering
system called REYES (an acronym for "Renders Everything You Ever Saw"). [3+3.5]
(b) The painter's algorithm is based on depth sorting and is a combined object and image space algorithm. It is as follows:1.Sort
all polygons according to z value (object space); Simplest to use maximum z value .2 Draw polygons from back (maximum z) to
front (minimum z) .The intersection x
+1
of the edge with the next scan line y=+1 can be found.y/x=m ,x
+1
=x

+1/m. [3+3.5]
(c)m=3,n=5,t
0
=t
1
=t
2
=t
3
=-1, t
6
=t
7
=t
8
=t
9
=6, t
4
=2 , t
5
=3. B-splines have two advantages over Bezier splines: (1) the degree of a B-
spline polynomial can be set independently of the number of control points (with certain limitations), and (2) B-splines allow
local control over the shape of a spline curve or surface. The trade-off is that B-splines are more complex than bezier splines.,
Bezier curves use a construction due to Bernstein, in which the interpolating polynomials depend on certain control points.
[2+4.5]
---------------------X-----------------
Max. Marks: 50