0% found this document useful (0 votes)
12 views

assignment 2024

Uploaded by

somya.234017
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
0% found this document useful (0 votes)
12 views

assignment 2024

Uploaded by

somya.234017
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/ 1

Assignment 2024

1. Use mid-point algorithm, scan convert the first quadrant of the circle with centre (12, 18)
and radius 5 units. Show all the steps.
2. Explain Sutherland-Hodgeman polygon clipping algorithm with the help of figure given
below.

3. Discuss the z-buffer method for visible surface detection.


4. Why do we need homogenous coordinates? Convert homogenous coordinate triple (8, 10, 2)
representation into Cartesian coordinate position (x, y).
5. What is aliasing? Explain any one technique to remove this effect.
6. Give the overall scaling matrix to double the size of the object.
7. Consider a clip rectangle with end-points (0, 0), (340, 0), (340, 340) and (0, 340). Using
Cohen Sutherland line clipping algorithm, clip the line segment AB. A = (-170,595), B = (170,
255).
8. Consider a triangle ABC in x-y plane A(2,3), B(6,8) and C(1,4).
a) Apply the translation with distance 1 towards X axis and 1 towards Y axis.
b) Obtain the new coordinates of the triangle. Rotate transformed triangle by 90
degree clockwise about the point A and
c) after that reflect it with respect to line y=x using homogenous coordinates.
9. Digitize the line with end points (20, 10) and (30, 18) by using Bresenham line drawing
algorithm for |m|<1.
10. What is the condition for trivial rejection for a line segment AB with A(0,5) and B(1,5) in
Cohen Sutherland Line Clipping Algorithm using rectangular window coordinates as
P(0,0),Q(0,1), R(1,0), S(1,1)?
11. State the odd-parity rule. Explain how horizontal edges are handled in odd parity rule.
12. Draw a line from (10,12) to (15,15) on a raster screen using Bresenham’s straight line
algorithm.
13. Prove that parallel lines remain parallel after any transformation.
14. Consider the polygon with vertices A(2,3), B(7,1),C(11,4), D(11,11), E(7,7), F(2,9).
Use scan fill algorithm to fill the polygon till scan line number 4. Show the entries in global
edge table and active edge table for every scan line.
15. Explain in detail the area subdivision Warnock’s Algorithm.

You might also like