Scribd
Upload
7 views2 pages

CG Mte Practice Set Ques

The document is a practice set for a Computer Graphics course, containing various problems related to pixel calculations, transformations, and algorithms for drawing lines and shapes. It covers topics such as the DDA algorithm, Bresenham's algorithm, clipping methods, and transformations including translation, rotation, and scaling. Each problem requires calculations or explanations of graphics concepts and algorithms.

Uploaded by

subscribtionall
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

CG Mte Practice Set Ques

The document is a practice set for a Computer Graphics course, containing various problems related to pixel calculations, transformations, and algorithms for drawing lines and shapes. It covers topics such as the DDA algorithm, Bresenham's algorithm, clipping methods, and transformations including translation, rotation, and scaling. Each problem requires calculations or explanations of graphics concepts and algorithms.

Uploaded by

subscribtionall
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MTE Practice Set

Computer Graphics (RIUC408B)

1. A display screen has a resolution of 1024 × 768 pixels and refreshes at 75 Hz.
Calculate the time taken to scan one row of pixels during each refresh cycle.
2. How many pixels are present on a screen with a resolution of 1920 × 1080 pixels?
Also, calculate how many pixels are scanned per frame.
3. A monitor refreshes at 75 frames per second. For raster systems with resolutions of
800 × 600 and 1920 × 1080, determine the number of pixels accessed per second.
4. Use the DDA algorithm to draw a line between points (1, 2) and (7, 5). List each step
of the algorithm.
5. A rectangle has vertices at P(2, 2), Q(6, 2), R(6, 5), and S(2, 5). Translate it by (−2, 3).
Determine the new coordinates of the rectangle.
6. A circle with radius 7 is centered at (4, −2). Translate it by (3, 4). What are the new
center coordinates, and has the radius changed?
7. A line segment runs from (2, 1) to (6, 5). Apply a 45° clockwise rotation to this line.
Find the new end points.
8. Outline the steps of Bresenham’s algorithm for plotting a line from (x1, y1) to (x2,
y2) on a pixel grid.
9. Describe and execute Bresenham’s line algorithm for a line from (2, 1) to (8, 4) on a
15 × 15 frame buffer. Indicate which pixels are activated.
10. A rectangle with vertices at (0, 0), (4, 0), (4, 2), and (0, 2) is subjected to:
i. Uniform scaling by 1.5
ii. Rotation of 180° around the origin
Determine the final coordinates after transformations.
11. A point P(3, 4) undergoes three transformations in the following sequence:
i. Translate by (−1, 2)
ii. Rotate 180° about the origin
iii. Scale by 3 in x and 0.25 in y
Use matrix multiplication to compute the final coordinates.
12. A line changes from initial end points A(1, 1) and B(2, 2) to A′(−1, 0) and B′(0, 1)
after transformation. Determine the transformation matrix applied.
13. Explain the role of homogeneous coordinates in 2D graphics transformations.
Compare them with Cartesian coordinates using a suitable transformation example.
14. Reflect a polygon with vertices at (2, 0), (4, −2), (6, 0), and (4, 2) across:
i. The line Y = −2
ii. The line X = −3
15. Use the Liang-Barsky algorithm to clip a line from (4, 9) to (10, 11) against a window
defined by corners at (2, 3) and (12, 9). Detail each step.
16. How does the midpoint circle algorithm determine the symmetry of a circle? Compute
and list the first 8 pixels of a circle with radius 6 centered at the origin.
17. A polygon consists of a triangle XYZ with X(2,3), Y(5,3), Z(3.5, 6) over a base
rectangle WXYZ with W(2,0) and Z(5,0). Apply the following:
i. Scale by 0.5 along Y, with reference point (3.5, 3)
ii. Rotate 180° around (2, 0)
Compute the new coordinates.
18. Discuss the stages of the 2D viewing pipeline. A line from (1, 4) to (12, 7) is to be
clipped using Cohen-Sutherland algorithm in a window with x ∈ [2, 11] and y ∈ [3,
6]. Show the clipping process step-by-step.
19. Clip the line segment from A(−1, 4) to B(9, 5) using Liang-Barsky, given the clipping
window from (1,1) to (8,5). Show each step with calculations.
20. Explain the Liang-Barsky line clipping method using the line from (3,6) to (11,9) and
a clipping window with x: [4,10], y: [5,8]. Highlight efficiency over Cohen-
Sutherland.
21. Apply the Cohen-Sutherland algorithm to a line between P(30, 60) and Q(110, 50)
against a clipping rectangle with corners (40, 20) and (100, 80). Show the region
codes and clipped segment.
22. A square has vertices at (−2, 0), (0, 0), (0, 2), and (−2, 2). First translate it by (4, 0),
then rotate it 90° about (1, 1). Compute final coordinates and interpret the result.
23. Write the Liang-Barsky algorithm and apply it to a line from (3,8) to (10,11) with a
clipping window of xmin=4, xmax=9, ymin=5, ymax=10.
24. Compare and contrast DDA and Bresenham’s line drawing algorithms in terms of step
calculation, pixel accuracy, and efficiency. Which would be preferred in a
performance-critical application and why?
25. Draw a line from (1, 1) to (9, 6) using both the DDA and Bresenham’s algorithms.
Show step-by-step outputs and discuss differences in pixel selection.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy