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.
Explain the term Computer graphics.
Explain the term Color Look up table?
Illustrate the term raster scan or refresh cycle?
Define the term Bezier Basis Function and surface patch?
What do you mean by the term spline representation? Also describe its key features?
Write down a short note on Liquid crystal displays. Also mention its two types?
Illustrate the term Center of Projection (COP)?
Describe what are the composite monitors?
Explain the term rendering bi-cubic surface patches of the constant u and v method?
Briefly write down the algorithm for the area subdivision method?
18,76,764
1943212 Asked
3,689
Active Tutors
1434543
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!