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.
Write a short note on GIF (or Graphic Interchange Format)?
Describe briefly the Object-space and Image-space approaches in Visibility tests?
Explain the benefits of rendering polygons through the scan line method?
Define the term Computer graphics in brief?
Explain the term plane of projection?
Explain the advantages and disadvantages of Penetration techniques?
Explain the term Liang Barsky line clipping in brief. Write down its key features?
Define Projection?
How realistic pictures are created in computer graphics?
Briefly explain the fundamental of geometric transformations?
18,76,764
1948998 Asked
3,689
Active Tutors
1413085
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!