www.jntuworld.

com

R05

Code No: R05420307

Set No. 2

IV B.Tech II Semester Examinations,AUGUST 2011

COMPUTER GRAPHICS
Common to Mechanical Engineering, Production Engineering, Automobile
Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) Distinguish between boundary representation and space-partitioning representation of solid object representation schemes.
(b) List and describe the polygon tables representation for polygon surfaces of a
3-D object. Give an example.
[8+8]

D
L

2. (a) Write an algorithm to implement the flood-fill algorithm, using the 4-connected
definition for region pixels.

R
O

(b) Write the steps involved in Bresenhams method for line generation whose
slope is between 450 and 900 .
[8+8]
3. (a) What is the fraction of the total time per frame spent in retrace of electron
beam for a non-interfaced raster system with a resolution of 1280 1024,
a refresh rate of 60 Hz, a horizontal retrace time of 5 micro seconds and a
vertical retrace time of 500 micro seconds.

W
U

(b) Explain the architecture of a simple random scan system.

[10+6]

T
N

4. (a) How does the z-buffer algorithm determine which surfaces are hidden.
(b) Show how the calculation of the intersection of an edge with a scan line can
be made incremental as opposed to absolute.
[8+8]

5. Show that the transformation matrix for a reflection about the line y=x is equivalent
to a reflection relative to the x - axis followed by a counter clockwise rotation of
900 .
[16]
6. (a) List the algorithms which are suitable for line clipping when the clipping
polygon is non-rectangular window.
(b) Explain about the following categories of lines with respect to rectangular
clipping window.
[8+8]
i. Completely visible
ii. Clipping-candidate
iii. Completely invisible.
7. (a) Explain how the simple animation effects are achieved by look-up table entries.
(b) Give a brief note about graphical languages for animation.

[8+8]

8. Find the matrix for mirror reflection with respect to the plane passing through the
origin and having a normal vector whose direction is N = I + J + K.
[16]

*********
1
www.jntuworld.com

www.jntuworld.com

R05

Code No: R05420307

Set No. 4

IV B.Tech II Semester Examinations,AUGUST 2011

COMPUTER GRAPHICS
Common to Mechanical Engineering, Production Engineering, Automobile
Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) How does the z-buffer algorithm determine which surfaces are hidden.
(b) Show how the calculation of the intersection of an edge with a scan line can
be made incremental as opposed to absolute.
[8+8]

D
L

2. (a) List the algorithms which are suitable for line clipping when the clipping
polygon is non-rectangular window.
(b) Explain about the following categories of lines with respect to rectangular
clipping window.
[8+8]

R
O

i. Completely visible
ii. Clipping-candidate
iii. Completely invisible.

W
U

3. Find the matrix for mirror reflection with respect to the plane passing through the
origin and having a normal vector whose direction is N = I + J + K.
[16]
4. (a) What is the fraction of the total time per frame spent in retrace of electron
beam for a non-interfaced raster system with a resolution of 1280 1024,
a refresh rate of 60 Hz, a horizontal retrace time of 5 micro seconds and a
vertical retrace time of 500 micro seconds.

T
N

(b) Explain the architecture of a simple random scan system.

[10+6]

5. (a) Distinguish between boundary representation and space-partitioning representation of solid object representation schemes.
(b) List and describe the polygon tables representation for polygon surfaces of a
3-D object. Give an example.
[8+8]
6. (a) Explain how the simple animation effects are achieved by look-up table entries.
(b) Give a brief note about graphical languages for animation.

[8+8]

7. Show that the transformation matrix for a reflection about the line y=x is equivalent
to a reflection relative to the x - axis followed by a counter clockwise rotation of
900 .
[16]
8. (a) Write an algorithm to implement the flood-fill algorithm, using the 4-connected
definition for region pixels.
(b) Write the steps involved in Bresenhams method for line generation whose
slope is between 450 and 900 .
[8+8]

*********
2

www.jntuworld.com

www.jntuworld.com

R05

Code No: R05420307

Set No. 1

IV B.Tech II Semester Examinations,AUGUST 2011

COMPUTER GRAPHICS
Common to Mechanical Engineering, Production Engineering, Automobile
Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) List the algorithms which are suitable for line clipping when the clipping
polygon is non-rectangular window.
(b) Explain about the following categories of lines with respect to rectangular
clipping window.
[8+8]
i. Completely visible
ii. Clipping-candidate
iii. Completely invisible.

D
L

2. (a) How does the z-buffer algorithm determine which surfaces are hidden.

R
O

(b) Show how the calculation of the intersection of an edge with a scan line can
be made incremental as opposed to absolute.
[8+8]
3. (a) Distinguish between boundary representation and space-partitioning representation of solid object representation schemes.

W
U

(b) List and describe the polygon tables representation for polygon surfaces of a
3-D object. Give an example.
[8+8]

T
N

4. Find the matrix for mirror reflection with respect to the plane passing through the
origin and having a normal vector whose direction is N = I + J + K.
[16]
5. (a) Write an algorithm to implement the flood-fill algorithm, using the 4-connected
definition for region pixels.

(b) Write the steps involved in Bresenhams method for line generation whose
slope is between 450 and 900 .
[8+8]
6. (a) What is the fraction of the total time per frame spent in retrace of electron
beam for a non-interfaced raster system with a resolution of 1280 1024,
a refresh rate of 60 Hz, a horizontal retrace time of 5 micro seconds and a
vertical retrace time of 500 micro seconds.
(b) Explain the architecture of a simple random scan system.

[10+6]

7. Show that the transformation matrix for a reflection about the line y=x is equivalent
to a reflection relative to the x - axis followed by a counter clockwise rotation of
900 .
[16]
8. (a) Explain how the simple animation effects are achieved by look-up table entries.

(b) Give a brief note about graphical languages for animation.

5

******
3

www.jntuworld.com

[8+8]

www.jntuworld.com

R05

Code No: R05420307

Set No. 3

IV B.Tech II Semester Examinations,AUGUST 2011

COMPUTER GRAPHICS
Common to Mechanical Engineering, Production Engineering, Automobile
Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) List the algorithms which are suitable for line clipping when the clipping
polygon is non-rectangular window.
(b) Explain about the following categories of lines with respect to rectangular
clipping window.
[8+8]

D
L

i. Completely visible
ii. Clipping-candidate
iii. Completely invisible.

R
O

2. (a) How does the z-buffer algorithm determine which surfaces are hidden.

(b) Show how the calculation of the intersection of an edge with a scan line can
be made incremental as opposed to absolute.
[8+8]

W
U

3. (a) Explain how the simple animation effects are achieved by look-up table entries.
(b) Give a brief note about graphical languages for animation.

T
N

[8+8]

4. (a) What is the fraction of the total time per frame spent in retrace of electron
beam for a non-interfaced raster system with a resolution of 1280 1024,
a refresh rate of 60 Hz, a horizontal retrace time of 5 micro seconds and a
vertical retrace time of 500 micro seconds.

(b) Explain the architecture of a simple random scan system.

[10+6]

5. Show that the transformation matrix for a reflection about the line y=x is equivalent
to a reflection relative to the x - axis followed by a counter clockwise rotation of
900 .
[16]
6. (a) Write an algorithm to implement the flood-fill algorithm, using the 4-connected
definition for region pixels.
(b) Write the steps involved in Bresenhams method for line generation whose
slope is between 450 and 900 .
[8+8]
7. Find the matrix for mirror reflection with respect to the plane passing through the
origin and having a normal vector whose direction is N = I + J + K.
[16]
8. (a) Distinguish between boundary representation and space-partitioning representation of solid object representation schemes.
(b) List and describe the polygon tables representation for polygon surfaces of a
3-D object. Give an example.
[8+8]

*********
4
www.jntuworld.com