What are the differences between Bresenham's line algorithm and Bresenham's circle algorithm?

Answer 1

These two algorithms are almost completely different. The only real similarity is that they are each designed to use only integer addition/subtraction and multiplication, avoiding expensive division and floating point operations.

Answer 2

DDA uses float numbers and uses operators such as division and multiplication in its calculation. Bresenhams algorithm uses ints and only uses addition and subtraction. Due to the use of only addition subtraction and bit shifting (multiplication and division use more resources and processor power) bresenhams algorithm is faster than DDA in producing the line. Im not sure, though if i remember right, they still produce the same line in the end. One note concerning efficiency: Fixed point DDA algorithms are generally superior to Bresenhams algorithm on modern computers. The reason is that Bresenhams algorithm uses a conditional branch in the loop, and this results in frequent branch mispredictions in the CPU. Fixed point DDA also has fewer instructions in the loop body (one bit shift, one increment and one addition to be exact. In addition to the loop instructions and the actual plotting). As CPU pipelines become deeper, mispredictions penalties will become more Severe.

Answer 3

Difference Between DDA and Bresenham Algorithm

• DDA uses floating points where as Bresenham algorithm use fixed points.

• DDA round off the coordinates to nearest integer but Bresenham algorithm does not.

• Bresenham algorithm is much accurate and efficient than DDA.

• Bresenham algorithm can draw circles and curves with much more accuracy than DDA.

• DDA uses multiplication and division of equation but Bresenham algorithm uses subtraction and addition only.

Answer 4

dda is not much efficient whereas bresnham algothm is much efficient than dda.