Computer Graphics

Introduction & Basics

1. What do you mean by refresh buffer?
2. What is bitmap & pixmap?
3. What do you mean by raster scan? What are its disadvantage and advantage?
4. What is frame buffer? [SU 2014, 2014]
5. What do you mean by aliasing & ant aliasing?
6. What do you mean by CGS, GKS, PHIGS, SRGP, and SPHIGS?
7. Anti-aliasing a serious problem that it produces unpleasant or even misleading visual effect /
artifacts. Discuss situation where that artifacts matter and these in which they do not. Discuss various
ways to minimize the effects of jaggies and explain what the cost of those remedies might be.
8. Write a short note on – Computer Art. [CU 2006]
9. Write a short note on – Animation. [CU 2009, 2010 SU 2012]
10. What do you mean by morphing? [SU 2012 2014]
11. Discuss how linear interpolation can be used to transform a line segment into two connected line
segments?
12. What is shielding?
13. Write a short note on – Application of computer graphics. [CU 2010]
14. Explain the working principle of CRT, LCD and plasma panel. [SU 2015]
15. What conventions are used in graphics monitor in defining the origin for X and Y coordinates?
[CU 2010]
Scan Conversion
16. What is scan conversion? Write 3 drawbacks of scan conversion. [SU 2013]
17. Describe DDA line drawing algorithm. Hence, Write DDA line drawing algorithm.
18. Use DDA line generation algorithm to draw a line from (2, 2) to (8, 6). Draw the necessary
diagram. [CU 2014]
19. Use DDA line generation algorithm to draw a line from (5, 4) to (12, 7). Draw the necessary
diagram.
20. Use DDA line generation algorithm to draw a line from (2, 7) to (9, 1). Draw the necessary
diagram.
21. Use DDA line generation algorithm to draw a line from (2, 2) to (9, 2). Draw the necessary
diagram.
22. Use DDA line generation algorithm to draw a line from (2, 5) to (2, 12). Draw the necessary
diagram.
23. Use pseudo code to describe the DDA algorithm for scan converting a line whose slope is between
45 ° and−45° i.e. ¿ m∨¿ 1. [SU 2011]
24. Describe Midpoint line algorithm. What are its limitations? How the floating point calculation in
midpoint algorithm be removed?
25. Describe Bresenham line drawing algorithm? Compare its performance with DDA line algorithm.
[CU 2007, 2011, 2013 2016]
26. Use Bresenham line generation algorithm to draw a line from (5, 5) to (13, 9). Draw the necessary
diagram.
27. Use Bresenham line generation algorithm to draw a line from (20, 10) to (30, 18). Draw the
necessary diagram.
28. “The 8-way symmetry of a circle can be used to devise an efficient circle drawing algorithm” –
justify the statement with a suitable algorithm. [CU 2011]
29. Describe midpoint circle drawing algorithm? How floating point calculation be removed?
[CU 2009]
30. Using midpoint circle drawing algorithm draw a circle with radius of 8 units and origin at (3, 4).
[SU 2015]
31. Describe Bresenham circle drawing algorithm? Hence, write the algorithm. [SU 2013]
32. Find the points required to plot the circle with center (2, 2) and radius 3 using Bresenham’s circle
drawing algorithm. [CU 2010]
1
33. Show why the point-to-line error is always ≤ for the midpoint line drawing algorithm?
2
[CU 2009]
34. Find the pixels to be chosen to draw a line with end points (0 , 0)∧(8 , 4) using (i) DDA (ii)
Midpoint (iii) Bresenham line drawing algorithm.
35. Find the pixels to be chosen to draw a circle with radius 5 using (i) Midpoint (ii) Bresenham circle
drawing algorithm.
36. Describe midpoint ellipse drawing algorithm? [CU 2007, 2013]
2 2
x y
37. Find the pixels to be chosen to draw an ellipse + =1, in the first quadrant only, using Midpoint
25 16
algorithm.
Polygon filling
38. Write an algorithm for rectangle filling?
39. Write an algorithm for polygon filling?
40. What is seed pixel? Explain flood fill algorithm to scan convert a polygon. [SU 2013]
41. What are the steps required to scan convert a polygonal area using scan line algorithm?
[SU 2011]

2D & 3D Transformation

42. Write a note on: 2D transformation.

43. Discuss translation, Rotation and Scaling with respect to origin in connection with geometric and
coordinate transformation in two dimensional structures? How can these represented by matrices?
[CU 2006, 2008 SU 2014]
44. Write a note on: Composite transformation.
45. Show that, two successive rotations, scaling and translation in 2D in additive, multiplication and
additive respectively. [CU 2012 SU 2014]
46. What is shear transformation?
47. Prove that we can transform a line by transforming its endpoints and then constructing a new line
between the transformed endpoints.
48. Prove that 2D rotation and scaling commute if Sx=Sy or if θ=nπ for integral n and that otherwise
they do not. [CU 2009 SU 2011]
49. What is the advantage of Homogenous coordinate system?[CU 2011, 2012 SU 2015]
50. Discuss translation, scaling and rotation in homogenous coordinate.
51. Compare between coordinate transformation and geometric transformation. [SU 2011]
52. “One reason that homogenous coordinate are attractive is that 3D points at infinity in Cartesian
coordinate can be represented explicitly in homogenous coordinates”. How can be done?
53. Consider a circle with centre with centre (0, 0) and radius 4. Suppose the circle is transformed in
such a way that its circumference has become half in length and its centre has been shifted to (2, 3). Find
out the underlying transformations. [SU 2011]
54. Discuss the concept of Inverse transformation
55. Write the general form of the matrix for rotation about a point P(h,k).
56. Perform a 45 °rotation of the triangle A(0,0), B(1,1) and C(5,2) (i) about the origin (ii) about
P(-1,-1). [CU 2014 SU 2014 2015]
57. Magnify the triangle A(0,0), B(1, 1) and C(5,2) to twice its size while keeping C(5,2) fixed.
Write down the steps to find the composite transformation matrix and compute resultant magnified
triangle. [CU 2012]
58. A cube with unit distance is placed at origin in first octant. Reflect it with respect to the plane z = 0.
Then perform 500% scaling. Find the transformation matrix. [CU 2016]
59. Describe the transformation which reflects an object about a line L.
60. Find the form of the matrix for reflection about a line L with slope m and y intercept (0 , b)
[CU 2012]
61. Show that in 2D, reflection about X axis followed by a reflection through the line y=− x is
equivalent to a rotation about the origin. [CU 2014]
62. Reflect the diamond shaped polygon whose vertices are A(-1,0) , B(0,-2), C(1,0) and D(0,2) about
(a) horizontal line y = x + 2 (b) vertical line x = 2 and (c) line y = x + 2.
[CU 2009 SU 2014]
63. A reflection along the line y = x is equivalent to the reflection along X axis followed by
anticlockwise rotation by α degree. Find α . [CU 2015]
64. Find the equation of the circle (x ' )2 +( y ' )2=1 in terms of xy coordinate assuming that the x ' y '
coordinate system results from a scaling of a units in x direction and y units in y direction.
65. Find the equation of the line y=mx+c of xy coordinate system to x ’ y ’ coordinate system which
results from a 90 ° rotation of the xy system.
66. Find the instance of the transformation which places a half size copy of square A(0,0), B(1,0),
C(1,1) and D(0,1) so that the centre of the square is at (-1,-1).
67. Consider a triangle A(4 , 1), B(5 , 2) and C (4 ,3). Reflect the triangle about X-axis.
68. Consider a triangle A(2, 2), B(4 , 2)and C (4 , 4).Rotate the triangle by90 ° twice about the origin.
69. Consider a point (3 , 2 ,1 , 1) in homogeneous coordinate system. Find the new point after translation
in (x , y , z) direction by (−1 ,−1 ,−1) followed by successively 30 ° rotation about X-axis and 45 °
about Y-axis.
70. Write a note on 3D transformation. [SU 2008]
71. Discuss translation, scaling and rotation with respect to origin in connection with geometric and
coordinate transformation in 3D structure. How these can be represented using matrices?
72. Write a short note 3D shearing. [CU 2015]
Viewing & Clipping
73. Distinguish between viewport and window. [SU 2014]
74. What do you mean by clipping? What is line clipping? [CU 2007, 2008 SU 2014 2015]
75. Describe Cohen-Sutherland line clipping algorithm. [SU 2014]
76. Let R be the rectangular window whose lower left hand corner is at L(−3 , 1) and upper right hand
corner is at R(2,6). Apply Cohen-Sutherland algorithm to clip the line segments AB where A(-4,7)
and B(-2,10), CD where C(-4,2) and D(-1,7),EF where E(-2,3) and F(1,2) and GH where G(-
4,2) and H(-1,7).
[SU 2014]
77. State the conditions for which a line will be completely clipped. Clip a line
A(3,20), B(13,3) against a rectangular window whose left-bottom and top-corner
are at points (5,5) and (25, 15) respectively.
[CU 2012]
78. Consider a rectangle defined by (100, 10), (160, 10), (160, 40) and (100, 40). Discuss clipping
situation of the straight line PQ using Cohen-Sutherland line clipping algorithm where P(50, 0) and
Q(70, 80). [CU 2015]
79. What is the significance of region code in the context of Cohen-Sutherland line clipping algorithm?
[CU 2011]
80. Describe Midpoint subdivision based line clipping algorithm. [SU 2015]
81. What are meant by interior and exterior clipping? [CU 2011]
82. What is polygon clipping? Describe Sutherland–Hodgeman polygon clipping algorithm. [CU 2008,
2014]
83. Define convex and concave polygon. [SU 2013]
84. Consider a convex polygon with n vertices being clipped against a clip rectangle. What is the
minimum number of vertices in the resulting clipped polygon? What is the minimum number? Consider
the same problem for a concave polygon. How many polygons might result? If a single polygon results,
what is the longest number vertices it might have? [CU 2009]
85. Explain why Sutherland-Hodgeman polygon clipping algorithm works for only convex clipping
regions.
Projection
86. What is projection? Mention its importance. [CU 2010, 2014 SU 2015]
87. Differentiate between perspective and parallel projection. [CU 2010 SU 2012 2015]
88. Describe perspective and parallel projection. [CU 2015 2016]
89. Classify geometric projection and define each category.
90. Find the perspective projection matrix when the projection plane is normal to Z axis at z=d and at
z=0
91. Find the perspective projection of general point p = (x, y, z) onto the projection plane
P p= ( x p , y p , z p ) .
Miscellaneous
92. What is bitplane? What dpi? What is pixel?
93. What is the job of a display controller?
94. Discuss how linear interpolation can be used to transform a line segment into two connected line
segments. [CU 2007]
95. Write a short note on – Beizer curve. [CU 2012 2015 SU 2012]
96. In a 512 × 512raster on a monochrome display with an average access rate of 200 nanoseconds /
pixel, what is the refresh rate?
97. How many bits are required for a 512 × 512 raster with each pixel being represented by 3 bits?
98. What is rate of a 1024 × 1024 frame buffer with an average access rate of 200 nanoseconds / pixel
on a simple color display?
99. How many pixels are there in a 1024 × 1024 frame buffer?
100.How many bits are required for a 24-bit plane 1024 × 1024element raster?
101.What is the access rate / pixel of a 4096 × 4096 raster having a refresh rate of 30 frame/ sec?
102.What do you mean by resolution of an image? Compute the resolution of a 2x2 inch image that has
512 ×512 pixels.
103.What is aspect ratio of an image? [SU 2014 2015]
104.If an image has a height of 2 inches and an aspect ratio of 1.5, what is its width? If we want to
resize a1024 × 768 image to one that is 640 pixels wide with the same aspect ratio, what would be the
height of the resized image?
105.Consider an image containing a self of 10,000 1 inch unconnected vector. Contrast the storage
required for a vector display list with that for a 1 – bit raster image for a 1024 × 1024 bit level display to
store this image – Assume that it takes 8 – bit opcode to specify vector draw, and four 10 – bit
coordinates to store a vector in the vector display list. How do these numbers vary as a function of the
number and size of the vectors, the number of bit per pixel, and the resolution of the raster display?
What conclusion can you draw about the relative sizes of refresh memory required?
106.Why hidden surface removal is needed? [SU 2013]