# Which algorithms are given by Bresenham?

## Which algorithms are given by Bresenham?

This algorithm is used for scan converting a line. It was developed by Bresenham. It is an efficient method because it involves only integer addition, subtractions, and multiplication operations….Bresenham’s Line Algorithm:

x y d=d+I1 or I2
6 4 d+I1=-1+8=7
7 4 d+I2=7+(-6)=1
8 5

### What is the use of Bresenham line drawing algorithm?

Bresenham’s line algorithm is a line drawing algorithm that 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.

#### Why DDA is less efficient than Bresenham?

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.

Which algorithm is faster in DDA and Bresenham?

While the calculation speed of Bresenham line algorithm is faster than DDA algorithm.

What are the steps for Bresenham circle drawing algorithm?

Bresenham’s Circle Algorithm:

1. Step1: Start Algorithm.
2. Step2: Declare p, q, x, y, r, d variables.
3. Step3: Enter the value of r.
4. Step4: Calculate d = 3 – 2r.
5. Step5: Initialize x=0.
6. Step6: Check if the whole circle is scan converted.
7. Step7: Plot eight points by using concepts of eight-way symmetry.

## What is D in Bresenham circle drawing algorithm?

In Bresenham’s algorithm at any point (x, y) we have two option either to choose the next pixel in the east i.e. (x+1, y) or in the south east i.e. (x+1, y-1). And this can be decided by using the decision parameter d as: If d > 0, then (x+1, y-1) is to be chosen as the next pixel as it will be closer to the arc.

### What is the difference in working of DDA and Bresenham line drawing algorithms?

The main distinction between DDA algorithm and Bresenham line algorithm is that, the DDA algorithmic rule uses floating purpose values whereas in Bresenham, spherical off functions is used.