STUPIDSID
1 (a)
Derive all formulas for Bresenham line drawing algorithm. Write a function
Bresenhamline(x1, y1, x2, y2, type) so it draws line with specified type. If
type=0, solid line, type=1 dashed line and type=2 dotted line
7 M
1 (b)
Derive all formulas for Bresenham line drawing algorithm. Write a function
Bresenhamline(x1, y1, x2, y2, type) so it draws line with specified type. If
type=0, solid line, type=1 dashed line and type=2 dotted line
7 M
2 (a)
Briefly explain different methods to generate thick lines. Discuss merits and
demerits of each method.
7 M
2 (b)
What is frame buffer? How long would it take to load a 640 by 480 frame
buffer with 12 bits per pixel if transfer rate is 1Mbps? What is the size of
frame buffer? How many colours it support?
7 M
2 (c)
Briefly explain scan line polygon filling algorithm. Explain the fields of edge
table and criteria for adding and removing edge to active edge table.
7 M
3 (a)
Briefly explain NLN line clipping algorithm. What are the advantages of NLN over Cohen Sutherland line clipping algorithm
7 M
3 (b)
Prove that successive rotation is additive and commutative.
7 M
3 (c)
Briefly explain Cyrus back line clipping algorithm. Compare Cyrus back and Liang-Basky line clipping algorithm
7 M
3 (d)
Determine the transformation matrix which reflects given object about
Diagonal y=x.
7 M
4 (a)
Consider square with left-bottom corner at (2, 2) and right-top corner at (6,
6). Find out the transformation matrix which makes its size half such that its
centre remains same.
7 M
4 (b)
Define polygon mesh. Briefly explain different methods used to represent
polygon mesh with example.
7 M
4 (c)
Consider a triangle with vertices A(1,1), B(5,2) and C(3,4). Find out the
transformation matrix which rotates given triangle about point C (3,4) by an
angle 30 clockwise. Also find rotated triangle.
7 M
4 (d)
Compare perspective and parallel projection. Briefly explain different types
of parallel projections.
7 M
5 (a)
Classify the visible surface determination algorithm. Briefly explain z-buffer.
visible surface determination algorithm
7 M
5 (b)
Briefly explain diffuse and specular reflection.
7 M
5 (c)
Briefly explain different techniques to make visible surface determination.
algorithm more effective. Briefly explain back face culling algorithm.
7 M
5 (d) (i)
Briefly explain LCD and LED display.
4 M
5 (d) (ii)
Briefly explain CMY colour model.
3 M
More question papers from Computer Graphics