Algorithm of Bresenhams line drawing
Write down the Bresenhams line drawing algorithm?
Expert
Step 1: Input the line end-points and store the left end-point in (X0, Y0)
Step 2: Load the (X0, Y0) to the frame buffer.
Step 3: Compute constants Δx, Δy, 2 Δy, -2 Δx, and get the decision parameters as: P0 = 2 Δy – Δx
Step 4: At all Xk all along the line, beginning at k = 0, execute the following test
If Pk < 0, then the next point to plot is (Xk+1, Yk) and Pk+1 = Pk + 2 Δy. Or else, next point to the plot is (Xk+1, Yk+1) and Pk+1 = Pk+2 Δy - 2 Δx.
Step 5: Repeat the step 4 Δx times.
List out the methods used for smoothly joining two line segments?
What is meant by the term tweening?
Define Octrees?
What do you understand by the term view plane? Also describe view-plane normal vector?
Write down a short note on the demerits of z-buffer technique?
What do you understand by the term scan conversion?
Describe briefly the term sweep representation.
Define Computer graphics?
What are a Line cap and also the various attributes of a line?
Write down a brief note on the term Video which is the application of computer animation?
18,76,764
1942131 Asked
3,689
Active Tutors
1460924
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!