# Difference Between DDA Line Drawing Algorithm and Bresenhams Line Drawing Algorithm | DDA Algorithm vs. Bresenhams Algorithm

**Difference Between DDA **** Line Drawing Algorithm and Bresenhams Line Drawing Algorithm.**

Digital Differential Analyzer Line Drawing Algorithm |
Bresenhams Line Drawing Algorithm | |
---|---|---|

Arithmetic |
DDA algorithm uses floating points i.e. Real Arithmetic. |
Bresenhams algorithm uses fixed points i.e. Integer Arithmetic. |

Operations |
DDA algorithm uses multiplication and division in its operations. |
Bresenhams algorithm uses only subtraction and addition in its operations. |

Speed |
DDA algorithm is rather slowly than Bresenhams algorithm in line drawing because it uses real arithmetic (floating-point operations). |
Bresenhams algorithm is faster than DDA algorithm in line drawing because it performs only addition and subtraction in its calculation and uses only integer arithmetic so it runs significantly faster. |

Accuracy & Efficiency |
DDA algorithm is not as accurate and efficient as Bresenham algorithm. | Bresenhams algorithm is more efficient and much accurate than DDA algorithm. |

Drawing |
DDA algorithm can draw circles and curves but that are not as accurate as Bresenhams algorithm. | Bresenhams algorithm can draw circles and curves with much more accuracy than DDA algorithm. |

Round Off |
DDA algorithm round off the coordinates to integer that is nearest to the line. | Bresenhams algorithm does not round off but takes the incremental value in its operation. |

Expensive |
DDA algorithm uses an enormous number of floating-point multiplications so it is expensive. | Bresenhams algorithm is less expensive than DDA algorithm as it uses only addition and subtraction. |

How is DDA less accurate than Bresenham’s as it is using floating points? And what does incremental value mean in the 6th point ‘Round-off’ ?

DDA line drawing algorithm round off the coordinates to nearest integer means computed point (10.48, 20.51)

is rounded to (10, 21)

in Bresenham line drawing algorithm Incremental value means that suppose you are at the position (2,3) and you have to select position between (3,3) and (3,4) it means point which is closer to original line that is you are taking is increamental value.

Thanks !!!

Its really useful…..

highly useful algorithm

Thank u…….

thanku so much ……..its differentiation is helpful for me….

but i want to know about drawbacks.

In DDA algorithm, Floating point calculation is time consuming and DDA algorithm has poor end point accuracy. But the drawbacks of DDA line drawing algorithm has been overcome in Bresenhams Line algorithm.

drawbacks of bresenhams??

If we compare DDA and Bresenhams Line drawing algorithm there are no such major disadvantages of bresenhams.

what are the drawbacks of dda algorithm?

In DDA algorithm, Floating point calculation is time consuming.

and DDA algorithm has poor end point accuracy.

this is very goooooooooood site …………… very nice yaaaaaaaar