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.
Illustrate the meaning of anti-aliasing?
Describe the De Casteljeau algorithm.
What do you mean by the term scientific visualization, name some software which are used in this region?
What do you understand by the term fixed point scaling?
Define Octrees?
Briefly discuss the concept of Hidden surface removal algorithms and Phong shading?
What is Koch curve?
Briefly explain the term graphic tablet?
Explain briefly De Casteljeau algorithm.
Define briefly the term point clipping?
18,76,764
1955742 Asked
3,689
Active Tutors
1426534
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!