Bresenhams line drawing algorithm
Describe the Bresenhams line drawing algorithm in brief?
Expert
In Bresenham’s approach the pixel position all along the line path is determined by the sampling unit X intervals. Beginning from the left end point(X0, Y0) of a given line we step to all successive columns and plot the pixel whose scan line Y-value is nearest to the line path. Supposing the Kth step in procedure, found out that the pixel at (Xk, Yk) decide which pixel to plot in the column Xk+1. Choices are (Xk+1, Yk) and (Xk+1, Yk+1)
What are the important properties of Bezier Curve?
What is the use of hidden line removing algorithm?
Write a short note on Scan-Line Method? Describe with an appropriate diagram?
Illustrate the term run length encoding?
Describe the Depth Buffer technique in short? Also describe its features?
Consider three different raster systems with resolutions of 640 x 480, 1280 x 1024, and 2560 x 2048? a) What size is frame buffer (in bytes) for each of these systems to store 12 bits per pixel?
Describe Interlaced Scan for image capture?
What do you understand by the perspective projection?
What are the steps involved in 3D transformation?
Write short notes on rendering the bi-cubic surface patches of the constant u and v technique?
18,76,764
1931402 Asked
3,689
Active Tutors
1426359
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!