Documente Academic
Documente Profesional
Documente Cultură
1
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008
COMPUTER GRAPHICS
(Mechatronics)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. (a) Explain the ‘stroke method’and the ‘bitmap method’ for generating characters.
(b) Discuss the antialiasing methods for lines. [8+8]
(a) a rotation
(b) a scaling
(c) a translation [5+5+6]
5. Explain the logic of the Sutherland-Hodgman algorithm with the help of a neat
flowchart. Illustrate the working of your flowchart with the help of a suitable
example. [16]
1 of 2
Code No: RR221402 Set No. 1
Figure 7
8. Describe Bezier surface generation technique with examples. [16]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR221402 Set No. 2
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008
COMPUTER GRAPHICS
(Mechatronics)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
⋆⋆⋆⋆⋆
1 of 1
Code No: RR221402 Set No. 3
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008
COMPUTER GRAPHICS
(Mechatronics)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. Explain the steps involved in Bresenham algorithm for line drawing. Demonstrate
with an example. Discuss its merits and demerits. [16]
2. (a) Briefly explain the steps involved in scan-line algorithm for polygon filling.
(b) What are the merits and demerits of flood-fill and scan-line algorithms?[10+6]
3. Give the homogeneous co-ordinate transformation matrices for the following trans-
formations:
(a) Scale x direction four times as large and the y-direction un-changed.
(b) Clock-wise rotation about the origin, by 60 degrees. [8+8]
5. Explain the Cohen-Sutherland algorithm for finding the category of a line segment.
Show clearly how each category is handled by the algorithm. [16]
Figure 7
8. Explain the following:
1 of 2
Code No: RR221402 Set No. 3
(a) Simple raster display system
(b) Sweeping method of interpolation. [8+8]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR221402 Set No. 4
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008
COMPUTER GRAPHICS
(Mechatronics)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. (a) Explain the ‘stroke method’and the ‘bitmap method’ for generating characters.
(b) Discuss the antialiasing methods for lines. [8+8]
3. Give the homogeneous co-ordinate transformation matrices for the following trans-
formations:
5. Explain the Cohen-Sutherland algorithm for finding the category of a line segment.
Show clearly how each category is handled by the algorithm. [16]
7. Outline the z-buffer algorithm. List the advantages and disadvantages of the z-
buffer algorithm. [16]
⋆⋆⋆⋆⋆
1 of 1