COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In breshnham line drawing algorithm, on a line having m<1, if current point is (xi, yi) and current decision parameter is <0, then next point (xi+1, yi+1) will be
|
|
(Xi+1, yi+1)
|
|
|
(Xi+1, yi)
|
|
|
(Xi, yi+1)
|
|
|
(Xi, yi)
|
Explanation:
Detailed explanation-1: -Bresenham Line Drawing Algorithm determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. To draw the line we have to compute first the slope of the line form two given points.
Detailed explanation-2: -Answer: a. It overcomes the drawbacks of DDA line drawing algorithm Explanation: The Bresenham’s algorithm was proposed in order to overcome the drawbacks of the DDA algorithm.
Detailed explanation-3: -Step 4: Calculate slope, m = dy / dx. Step5: For m < 1: Calculate initial decision variable: P = 2dy-dx.
There is 1 question to complete.