Bresanham circle algorithm uses the approach ofMidpointPointLineNone of theseView answer

The Bresenham circle algorithm uses the approach of Midpoint.

Here's a step-by-step explanation of how it works:

1. Start with the topmost point on the circle which is (0,r) where r is the radius of the circle.
2. Initialize the decision parameter as d = 3 - 2r.
3. Repeat the following steps until x <= y:
   • Draw the current point (x,y).
   • Increment x.
   • If d > 0, then increment y and update d as d = d + 4*(x - y) + 10.
   • Else, update d as d = d + 4*x + 6.
   • Draw the current point (x,y).
4. If the decision parameter d is less than 0, the midpoint is inside the circle, so choose the point E as the next point.
5. If the decision parameter d is greater than 0, the midpoint is outside or on the circle, so choose the point SE as the next point.

This algorithm is efficient because it uses only integer addition, subtraction and bit shifting, avoiding the need for floating point multiplication and division.