COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Bresenham’s line algorithm
|
|
|
Parallel line algorithm
|
|
|
Mid-point algorithm
|
|
|
DDA line algorithm
|
Detailed explanation-1: -Answer: d Explanation: The DDA is a faster method for calculating pixel positions.
Detailed explanation-2: -The computation speed of the Bresenham line method is significantly higher than that of the DDA algorithm. However, the computation speed of the Bresenham line algorithm is significantly faster than that of the DDA algorithm. It does not have a high degree of accuracy or precision.
Detailed explanation-3: -Bresenham’s Algorithm is faster than DDA Algorithm in line because it involves only addition & subtraction in its calculation and uses only integer arithmetic.
Detailed explanation-4: -Answer-B, Explanation-The DDA algorithm is a faster method for calculating pixel positions than direct use of line equation using y=mx+c because It eliminates floating point multiplication.
Detailed explanation-5: -Bresenham Algorithm was developed by J.E. Bresenham in 1962 and it is much accurate and much more efficient than DDA. It scans the coordinates but instead of rounding them off it takes the incremental value in account by adding or subtracting and therefore can be used for drawing circle and curves.