Using the DDA line drawing algorithm, determine the raster points for the line segment joining P(12,4) and Q(4,10).
_____ ___ _______ ____ ___ ________ ____ ______ ____ ______ ____.
_________ _______ _____ ____ _________ _________ _______ __________ _________.
____ ___ _______ _________ _____ ____.
____ ___ __________ __________ ______ ______ ______ _______ ___.
___ ________ ________ _____ ___ ________ _____ __________ _______ _______ ______ ________.
__________ ______ ________ __________ __________ ________ ___ _______ ________ _______.
___ ________ ____ _________ _______ _____ _________ ___.
_______ __________ _______ _________ ___ ________ ____ _______ __________ ______.
__________ ______ _________ ____ ____ ____ _____.
_________ _____ ______ ________ __________ _____ _________ _________ _________ ___ _________ ____.
________ _________ _____ ________ ________ ______.
_______ __________ ______ _______ ________ ______ __________ __________.
________ ______ ________ ________ _________ ______ ____.
_____ _____ _______ ___ _______ ______ ______ _____ ______ _________ __________.
___ _______ ___ ___ ______ _______ _____ ______.
_____ ___ ____ _______ _________ ________ _______ _______.
___ _______ ________ __________ ________ __________ __________ _______.
__________ ______ ____ _____ ___ _________ _____ ___ __________.
________ _______ ________ _________ ______ _______ ____ __________ _____ ______.
______ ______ _____ ______ _______ ______ _______ _____ ___ ____ ____ ___.
________ ________ _________ ____ ________ _____ ____ _________ _______.
____ _____ ___ ________ _________ _______ ___.
____ ___ __________ _____ ________ ___ _____ ________ __________ ________.
__________ _______ ___ ___ ____ ________.
_______ _____ ___ _________ __________ _________ _____ _____ ______.
__________ ________ _____ ________ ____ __________ ___.
_______ _______ ______ ___ _________ _____ ___ _________ __________ ___.
__________ ________ _______ ___ _________ ___.
___ _____ ___ _______.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
Design a program that performs continuous rotation of a hexagon about an arbitrary point (x₀, y₀).
b) Show that reflection about the line y = mx can be achieved by a sequence of rotation, reflection, and inverse rotation operations.
What do you understand by the following terms? Colour CRT Monitors, Beam Penetration Method, and Shadow Mask Method.
Let W be a window having two diagonally opposite corners at (1,1) and (5,4). Trace Cohen-Sutherland Line Clipping Algorithm for the line segment having two end points (0,0) and (4,5).
A cube has two diagonally opposite vertices at (2, 2, 2) and (6, 6, 6). Find the coordinates of all its corners and obtain its projection using an oblique parallel projection with α = 45°, ϕ = 30°.
b) Find the uniform cubic B-spline curve generated by the control points (2,1), (6,-3), (9,4), (14,0).
Write a C code for generating concentric circles.
Compare Boundary fill algorithm and Flood fill algorithm. Mention at least two advantages and limitations of both algorithms. Why does boundary fill algorithm fail when boundary is not completely closed? Explain with an example.
uppose we have a video monitor with a display area of measurement 12 inches across and 9.6 inches high. If the resolution is 1280×1024 pixels. What is the diameter of each pixel (in cm)?
