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.
What do you understand by the term hieroglyphics?
Explain clipping? Also describe the term covering or exterior clipping?
What are the various clipping operations are there? Briefly describe it.
Distinguish between emissive and non emissive displays?
Illustrate briefly the Sutherland-Hodgman Algorithm?
Illustrate the term Koch curve in short?
Define the term Computer graphics in brief?
Illustrate the merits of laser printers?
Write a short note on the term vector scan Display?
Briefly describe the kind of computer graphics?
18,76,764
1934649 Asked
3,689
Active Tutors
1445216
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!