Mid-Point Circle Drawing Algorithm

The mid-point circle drawing algorithm is an algorithm used to determine the points needed for rasterizing a circle. 
 

We use the mid-point algorithm to calculate all the perimeter points of the circle in the first octant and then print them along with their mirror points in the other octants. This will work because a circle is symmetric about its centre.

The algorithm is very similar to the Mid-Point Line Generation Algorithm. Here, only the boundary condition is different.

For any given pixel (x, y), the next pixel to be plotted is either (x, y+1) or (x-1, y+1). This can be decided by following the steps below.

1. Find the mid-point p of the two possible pixels i.e (x-0.5, y+1)
2. If p lies inside or on the circle perimeter, we plot the pixel (x, y+1), otherwise if it’s outside we plot the pixel (x-1, y+1)

Boundary Condition : Whether the mid-point lies inside or outside the circle can be decided by using the formula:- 
 

Given a circle centered at (0,0) and radius r and a point p(x,y) 
F(p) = x² + y² – r² 
if F(p)<0, the point is inside the circle
F(p)=0, the point is on the perimeter
F(p)>0, the point is outside the circle 
 

In our program, we denote F(p) with P. The value of P is calculated at the mid-point of the two contending pixels i.e. (x-0.5, y+1). Each pixel is described with a subscript k.
 

P_k = (X_k — 0.5)² + (y_k + 1)² – r² 
Now, 
x_k+1 = x_k or x_k-1 , y_k+1= y_k +1
∴ P_k+1 = (x_k+1 – 0.5)² + (y_k+1 +1)² – r² 
= (x_k+1 – 0.5)² + [(y_k +1) + 1]² – r² 
= (x_k+1 – 0.5)² + (y_k +1)² + 2(y_k + 1) + 1 – r² 
= (x_k+1 – 0.5)² + [ – (x_k – 0.5)² +(x_k – 0.5)² ] + (y_k + 1)² – r² + 2(y_k + 1) + 1
= P_k + (x_k+1 – 0.5)² – (x_k – 0.5)² + 2(y_k + 1) + 1 
= P_k + (x²_k+1 – x²_k) – (x_k+1 – x_k) + 2(y_k + 1) + 1 
= P_k + 2(y_k +1) + 1, when P_k <=0 i.e the midpoint is inside the circle 
(x_k+1 = x_k) 
P_k + 2(y_k +1) – 2(x_k – 1) + 1, when P_k>0 I.e the mid point is outside the circle(x_k+1 = x_k-1) 
 

The first point to be plotted is (r, 0) on the x-axis. The initial value of P is calculated as follows:-
 

P1 = (r – 0.5)² + (0+1)² – r² 
= 1.25 – r 
= 1 -r (When rounded off)
 

Examples: 
 

Input : Centre -> (0, 0), Radius -> 3
Output : (3, 0) (3, 0) (0, 3) (0, 3)
         (3, 1) (-3, 1) (3, -1) (-3, -1)
         (1, 3) (-1, 3) (1, -3) (-1, -3)
         (2, 2) (-2, 2) (2, -2) (-2, -2)

Input : Centre -> (4, 4), Radius -> 2
Output : (6, 4) (6, 4) (4, 6) (4, 6)
         (6, 5) (2, 5) (6, 3) (2, 3)
         (5, 6) (3, 6) (5, 2) (3, 2)

Output: 
 

(3, 0) (3, 0) (0, 3) (0, 3)
(3, 1) (-3, 1) (3, -1) (-3, -1)
(1, 3) (-1, 3) (1, -3) (-1, -3)
(2, 2) (-2, 2) (2, -2) (-2, -2)

Time Complexity: O(x – y)
Auxiliary Space: O(1) 
References : Midpoint Circle Algorithm 
Image References : Octants of a circle, Rasterised Circle, the other images were created for this article by the geek
Thanks Tuhina Singh and Teva Zanker for improving this article. 
This article is contributed by Nabaneet Roy. If you like neveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.