Difference Between DDA and Bresenham’s Line Algorithm
DDA Line Drawing Algorithm:
It stands for Digital Differential Analyzer. It is an incremental method of scan conversion of lines. DDA algorithm scans and converts lines with acceptable approximation insufficiently less time.
Bresenham’s Line Algorithm:
This Algorithm was developed by Bresenham. It is more accurate and efficient than the DDA algorithm because it cleverly avoids the “Round” function. It also scans and converts lines using only incremental integer calculation.
DDA vs Bresenham’s Line Algorithm:
|1. DDA Algorithm uses floating point, real arithmetic.||1. Bresenham's Algorithm uses fixed points, integer arithmetic.|
|2. DDA algorithm uses multiplication and division operations.||2. Bresenham's Algorithm uses addition and subtraction operations.|
|3. DDA algorithm is slower than Bresenham's Algorithm because it uses real arithmetic floating point operations.||3. Bresenham's Algorithm is faster than DDA algorithm because it uses integer arithmetic.|
|4. DDA algorithm can draw circles and curves with less accuracy.||4. Bresenham's Algorithm can draw circles and curves with much more accuracy.|
|5. DDA algorithm is less efficient than Bresenham's Algorithm.||5. Bresenham's Algorithm is more efficient than DDA Algorithm.|
|6. DDA algorithm round-off the co-ordinates to integer that is nearest to the line.||6. Bresenham's Algorithm doesn't round-off the co-ordinates.|