Code No: 22003
Time: 3hours
Max.Marks:60
Answer any Five questions
All questions carry equal Marks
1. Write and explain the Bresenham’s algorithm for circle drawing.
2. a) State and explain various graphic primitives.
b) Explain the inside test for a Polygon.
3. a) Derive the necessary transformation matrix for ratios about an arbitrary point in 2D.
b) Rotate the line which will be formed by joining the two points (4, 6) and (6, 10),about the point (1, 1) by an angle of 300 counter clockwise.
4. Write and explain the Cohen Sutherland Outcode algorithm for line clipping.
5. a) Explain the process of event handling.
b) What is meant by parallel projection? Derive the transformation matrix for it.
6. a) Explain the viewing transformation.
b) Discuss in detail the Warnock’s algorithm.
7. a) Discuss the shading algorithms.
b) What is meant by inter polation? Discuss its algorithms.
8. Write short notes on any three of the following.
a) Fractal lines
b) Illumination
c) Isometric Projection
d) Multiple Windowing
No comments:
Post a Comment