Question Bank for Computer Graphics and Multimedia

Short question
1.What do you mean by raster scan display?

In rastor scan display, the screen is divided into a grid of pixels, and an electron
beam scans across the screen from top to bottom, painting each line of pixels.
The beam's intensity is turned on and off to create an illuminated pattern of
spots.

2. Define parallel projection.

Parallel projection is a method of representing a three-dimensional object in

two dimensions by projecting it onto a fixed plane using parallel lines of sight. In
parallel projection, the centre of the projection lies at infinity.

3.Define prospective projection.

In Perspective Projection the center of projection is at finite distance

from projection plane. This projection produces realistic views but does not
preserve relative proportions of an object dimensions. Projections of distant
object are smaller than projections of objects of same size that are closer to
projection plane.

4. Write properties of bezier curve.

1. Bezier curves are widely available and used in various CAD systems, in general
graphics packages such as GL
2. The slope at beginning of the curve is along the line joining the first two control
points and the slope at the end of the curve is along the line joining the last two
points
3. Bezier curve always passes through the first and last points i.e p(o)=po, p(1,=pnlie)
4. The curves lies entirely within the convex hall formed by the four control points
5. The degree of polynomial defining the curve segment is one less than the no of
defining the polygon.

5.What is Frame Buffer Memory?

A framebuffer (frame buffer, or sometimes framestore) is a portion of random-
access memory (RAM) containing a bitmap that drives a video display. It is a
memory buffer containing data representing all the pixels in a complete video
frame.
6.What is multimedia?
Multimedia is the presentation of text, pictures, audio, and video with links and tools
that allow the user to navigate, engage, create, and communicate using a computer.

7.Define translation in 2D.

In 2D transformation, translation is a technique that moves an object or

coordinate system by a specified distance in the x and y axes.
8.Define scaling in 2D.

Scaling in 2D is the process of changing the size of an object or

coordinate system in a 2D plane.
9. Define rotation in 2D. What is scaling?

In 2D, "rotation" means turning an object around a fixed point by a specific

angle within a plane,, while "scaling" refers to enlarging or shrinking an object
by multiplying its coordinates with a scaling factor, effectively changing its size
while maintaining its shape and orientation.

10. Give the matrix to shear in 2D.

11.What is a composite transformation?

A composite transformation is the result of combining two or more basic

geometric transformations (e.g., translation, rotation, scaling, shearing,
reflection) into a single operation. This approach simplifies the process of
applying multiple transformations to an object by representing them as a single
transformation matrix.
12.What are drawback of Cohen-Sutherland line clipping algorithm?

1. It is limited to rectangular clipping windows and cannot handle arbitrary-

shaped regions.

2. Inefficient for complex cases, as it may repeatedly compute region

codes and perform intersection calculations.

3. Performance degrades when a line spans multiple regions, requiring

multiple clipping operations.

4. Does not handle curved or non-linear lines, as it is specifically

designed for straight line segments.

5. Implementation can become cumbersome for 3D clipping or when

extending to non-rectangular boundaries.

13. Discuss the conditions for clipping a point against a given rectangular
window.

Conditions for checking if a point lies inside the window:

x≤ xmax

x ≥ xmin

y ≤ ymax

y ≥ ymin

Get the minimum and maximum coordinates of both viewing pane.

Get the coordinates for a point.

Check whether given input lies between minimum and maximum coordinate of
viewing pane.

If yes display the point which lies inside the region otherwise discard
It.

14.What are drawbacks of DDA line drawing algorithm?

The drawbacks of the DDA Line Drawing Algorithm:

1. Floating-point operations: It uses floating-point calculations, which

are computationally expensive and can slow down execution.

2. Rounding errors: Continuous rounding of coordinates may lead to

inaccuracies in pixel plotting.

3. Cumulative errors: Small errors accumulate over iterations, causing

noticeable deviations in longer lines.

4. Hardware dependency: It is less efficient on systems without

floating-point hardware support.

5. Not suitable for steep lines: For steep lines, the algorithm produces
uneven pixel distribution, leading to visual artifacts.
15.Derive the component matrix of translation.
16. Show that the composition of two rotation is additive

17. What is initial decision parameter value for Bresenham’s circle drawing
algorithm?

The initial decision parameter value for Bresenham's circle drawing

algorithm is
P0 = 3 – 2 x R

The initial decision parameter is calculated using the radius of the circle, 𝑟.

18. What is aspect ratio?

An aspect ratio is a proportional relationship between an image's width and

height. Essentially, it describes an image's shape. Aspect ratios are written as
a formula of width to height, like this: 3:2. For example, a square image has an
aspect ratio of 1:1, since the height and width are the same.

19. Name two essential features of graphics software.

1. Rendering: The process of generating 2D images from 3D models,

considering factors like lighting and texture.
2. User Interface (UI) and Interaction Tools: Allow users to create, modify,
and manipulate graphical objects through drawing and transformation tools.

20. What are the applications of computer graphics?

1. Entertainment: Used in animation, video games, and special effects in

movies for realistic visuals.

2. Education and Training: Simulations and visualizations for e-learning,

medical training, and flight simulators.

3. CAD (Computer-Aided Design): Designing and modeling in

engineering, architecture, and product manufacturing.

4. Data Visualization: Representing complex data using charts, graphs,

and interactive dashboards.
 5. Virtual Reality (VR) and Augmented Reality (AR): Immersive
environments for gaming, training, and real-world applications.

21. What is reference point and reference axis of transformation?

22. What is pixel?

A pixel is the smallest unit of a digital image or display and stands for
“picture element.” It is a very small, isolated dot that stands for one color
and plays the most basic part in digital images.
23. What is control point?

A control point is a point in space that influences the position, curvature,

or shape of a curve or surface, but the curve or surface does not
necessarily pass through it.

24. What do you understand by resolution?

Resolution refers to the level of detail or clarity of an image, display, or output.

It is typically defined as the number of pixels used to represent the image.

25. What is shearing?

Shearing is a geometric transformation in computer graphics that distorts an

object or coordinate system along a specific axis.

26. Derive the component matrix of rotation.

27. What is scan conversion?

Scan conversion is the process of converting a geometric representation of an

object, such as a line or curve, into a pixel-based representation that can be
displayed on a computer screen or printed on a page.

28. What is boundary fill algorithm?

This algorithm uses the recursive method. First of all, a starting pixel called as
the seed is considered. The algorithm checks boundary pixel or adjacent pixels
are colored or not. If the adjacent pixel is already filled or colored then leave it,
otherwise fill it. The filling is done using four connected or eight connected
approaches.

i. The boundary should be of one colour.

ii. The boundary colour and colour of pixels inside in boundary should be of
different colour.

29. What is morphing?

Morphing in computer graphics is a visual effects technique that creates a

smooth transition between two different images or shapes.

30. Why are hypertexts used for information representation in multimedia

packages?

Hypertexts are used for information representation in multimedia packages

because they allow for a non-linear, interactive way to access and navigate
through information, enabling users to explore related content by clicking on
links that connect different media types like text, images, audio, and video.

31. How the image is drawn in CRT monitor?

In a CRT monitor, an electron gun shoots a focused beam across the

screen, hitting phosphor dots that glow when struck, “painting” the
image pixel by pixel. This process, where the screen is scanned line by
line, is called “raster scanning,” with the beam’s intensity controlling
pixel brightness.

32. Write full form of i)MIDI ii)JPEG

i) Musical Instrument Digital Interface

ii) Joint Photographic Experts Group

Long Question

1.Scale the square ABCD (0,0)(3,0),(3,3),(0,3) three unit in X-direction and three
unit in Y-direction with respect to origin.

2.What is Computer Graphics? Explain the different Application of Computer

Graphics in several fields.

It is the use of computers to create and manipulate pictures on a display device.

It comprises of software techniques to create, store, modify, represents
pictures.

1. Entertainment: Used in animation, video games, and special effects in

movies for realistic visuals.

2. Education and Training: Simulations and visualizations for e-learning,

medical training, and flight simulators.

3. CAD (Computer-Aided Design): Designing and modeling in

engineering, architecture, and product manufacturing.
 4. Data Visualization: Representing complex data using charts, graphs,
and interactive dashboards.

5. Virtual Reality (VR) and Augmented Reality (AR): Immersive

environments for gaming, training, and real-world applications.

3. Triangle ABC is (0,0),(4,0)and (0,4 ) Find shearing Transformation with a=2

and b=2.

4. What is Cathode Ray Tube (CRT) . Explain functioning of CRT with proper
diagram.

Cathode Ray Tube (CRT):

CRT stands for Cathode Ray Tube. It is a specialized vacuum tube in

which images are produced when an electron beam strikes a
phosphorescent surface.
Once the electron heats the phosphorus, they light up, and they are
projected on a screen. The color you view on the screen is produced by a
blend of red, blue and green light.

Main Components of CRT are:

1. Electron Gun:

The electron gun creates a source of electrons which are focused into a
narrow beam directed at the face of the CRT.

2. Control Electrode: It is used to turn the electron beam on and off.

3. Focusing system: It is used to create a clear picture by focusing the

electrons into a narrow beam.

4. Deflection Coils:

Vertical and Horizontal Deflection Plates – Create the low-frequency

electromagnetic field needed to change the direction of electron beams.

5. Phosphorus-coated screen:

The inner surface of the screen is coated with tiny phosphor dots that
emit light when struck by the electron beam
5.Prove that the multiplication of transformation matrices for two successive
rotations is commutative.

Conclusion:

Matrix multiplication for two successive rotations is commutative only if the

rotations are about the same axis. For rotations about different axes, the
multiplication is generally not commutative.
6.Magnify the triangle with vertices A(0,0),B(1,1),C(5,2) to twice its size while
keeping C(5,2) fixed.

7. Prove that 2D rotation and scaling commute if Sx=Sy or Ɵ= nΠ for integer n

and otherwise they donot. Here Sx and Sy are the scaling along the X and Y axis
respectively and Ɵ is angle of rotation.
8.Discuss boundary fill and flood fill algorithm.

Boundary Filled Algorithm:

This algorithm uses the recursive method. First of all, a starting pixel called as the
seed is considered. The algorithm checks boundary pixel or adjacent pixels are
colored or not. If the adjacent pixel is already filled or colored then leave it,
otherwise fill it. The filling is done using four connected or eight connected
approaches.

i. The boundary should be of one colour.

ii. The boundary colour and colour of pixels inside in boundary should be of
different colour.
1. Four connected approaches: In this approach, left, right, above, below pixels are tested.
2. Eight connected approaches: In this approach, left, right, above, below and four diagonals are
selected.

Flood Fill Algorithm:

In this method, a point or seed which is inside region is selected. This point is
called a seed point. Then four connected approaches or eight connected
approaches is used to fill with specified color.

The flood fill algorithm has many characters similar to boundary fill. But this
method is more suitable for filling multiple colors boundary. When boundary is
of many colors and interior is to be filled with one color we use this algorithm.

Disadvantage:

1. Very slow algorithm

2. May be fail for large polygons

3. Initial pixel required more knowledge about surrounding pixels.

9. Discuss Sutherland hodgman polygon clipping algorithm.

The Sutherland-Hodgman polygon clipping algorithm is a computer graphics

technique used to "clip" a polygon against a defined clipping region, essentially
removing any portion of the polygon that falls outside the specified boundaries,
leaving only the visible part within the clipping area.

How it works:

The algorithm takes a polygon (subject polygon) and a clipping window as input.

For each edge of the clipping window (e.g., left, top, right, bottom), it examines
each vertex of the subject polygon to determine if it lies inside or outside the
clipping region.

If a vertex is outside, the algorithm calculates the intersection point between the
current edge of the polygon and the clipping window edge, adding this
intersection point to the output list.

The output list from one clipping edge becomes the input list for the next clipping
edge, repeating the process until all sides of the clipping window have been
processed.

The final output list represents the clipped polygon, containing only the vertices
that are visible within the clipping window.

Advantages:
Simple to implement and understand.

Efficient for clipping convex polygons.

Can be easily adapted to different clipping window shapes by changing the

clipping edge calculations.

Disadvantage of Cohen Hodgmen Algorithm:

This method requires a considerable amount of memory. The first of all polygons
are stored in original form. Then clipping against left edge done and output is
stored. Then clipping against right edge done, then top edge. Finally, the bottom
edge is clipped. Results of all these operations are stored in memory. So wastage
of memory for storing intermediate polygons.

10.Perform a 45° rotation of a triangle A(1,1),B(5,1),C(3,5) about an arbitrary

point P (3,3) ,about origin.

11.Explain the importance of homogeneous co-ordinate system.

Homogeneous coordinates are a way of representing points in a higher-

dimensional space to make it easier to perform transformations like rotation,
scaling, and translation using matrices. They allow for the efficient representation
and processing of geometric transformations.
12.Derive the relationship between window port and view port.
13.Write a short note on Bezier curve.

Bezier Curve

A Bezier curve is a parametric curve used extensively in computer graphics,

animation, and design for creating smooth and scalable shapes. It is defined by a
set of control points, where the curve starts at the first point, ends at the last,
and is influenced by the intermediate points.

Key Features:

1. Control Points: The shape is determined by control points, though the

curve does not necessarily pass through them.
2. Degree: The degree is one less than the number of control points.
3. Smoothness: The curve is smooth and continuous, ideal for modeling.

Applications:

 CAD: Designing curves and surfaces.

 Animation: Defining motion paths.
 Typography: Creating scalable fonts and graphics.
14.The eight-way symmetry of a circle can be used to design an efficient circle
drawing algorithm-justify the statement with suitable algorithm.
15. Derive a general transformation matrix for 3D rotation about x axis, y axis, z
axis.
16. What can be concluded about the visibility of line segment in Cohen-
Sutherland line clipping algorithm.

The Cohen-Sutherland algorithm divides a two-dimensional space into nine

regions to determine which lines are visible in the central region.

Totally visible

If both endpoints have a region code of 0000, the line segment is completely
visible and inside the clipping window.

Totally invisible

If the bitwise AND of the two endpoints' region codes is not 0000, the line
segment is not visible and is rejected.

Partially visible

If the line is not totally visible or invisible, it is partially visible and needs to be
subdivided. The subdivision process is repeated until the line segments are either
completely visible or completely invisible.

17. Use DDA line generation algorithm to draw a line from (2,2) to (6,6)

18. Distinguish between random scan display and raster scan display.

Example - Pen Plotter Example – TV Sets

19. Find the rotation transformation matrix form about an arbitrary line
y=mx+b.
20. Consider the rectangle defined by (100,10),(160,10),(160,40),(100,40).
Discuss clipping situation of straight line PQ using Cohen-Sutherland line
clipping algorithm where P(50,0) and Q(70,80)
21. Derive midpoint line drawing algorithm.
22. What are the advantages of Bresenham’s line drawing algorithm over DDA
line drawing algorithm?
Advantages of Bresenham’s Algorithm over DDA:

1. Integer Arithmetic: Uses only integer operations, making it faster than

DDA, which relies on slower floating-point calculations.
2. Accuracy: Avoids rounding errors and produces lines closer to the ideal
path.
3. Efficiency: Requires fewer computations per pixel, making it more suitable
for real-time rendering.
4. Smoother Lines: Produces visually smoother lines, especially for steep or
shallow slopes.
5. Hardware Friendly: Easier to implement in hardware due to its reliance on
integer calculations.
6. Versatility: Can be adapted for other shapes like circles and ellipses.

23. Clip a line A (3,20), B(13.3) against a rectangular window whose left-bottom
,top-corner are at the point (5,5), (25,15) respectively..
24. Discuss point clipping algorithm.

25. translation does not depend on reference point”- justify.

26. Discuss Cohen-Sutherland line clipping algorithm.
27. Derive and write midpoint circle drawing algorithm.
28. Compare parallel and perspective projections with reference to practical use
only.

29. Derive a general transformation matrix for 3D translation and scaling.