Skip to main content

Bresenhams Circle Generation Algorithm

Bresenhams circle generation algorithm aims to find out the points that lie on the circle (or approximately lie on the circle) in a pixel based display. In this algorithm we divide the circle into 8 parts and calculate the points only for one part and then apply the property of symmetry to get the points in the remaining 7 parts.

We divide the circle into the following parts.

At the beginning we start with the point x = 0, y = r ;
so we get the first point as (xc + x, yc + y) which lies on the circle. let us denote this point as (xp, yp).

now we have check if the neighbouring point (xp - 1, yp + 1) or (xp, yp + 1) lies on the circle, We do this by checking the value of the variable called parameter which checks if the point lies on the circle or not and accordingly we update the value of x and y to plot the next point.


  1. Plot the initial point with x = 0, y = r and initialize parameter = 3 - 2*radius
  2. While x < y keep repeating steps 3, 4 and 5
  3. If value of parameter is less than 0 then the point is inside the circle so increase the value of parameter = parameter + 4*x + 6 and x by 1.
  4. else the point is on or outside the circle hence increase the value of parameter = parameter + 4*(x - y) + 10 ; x by 1 and y by 1.
  5. Plot the new point.

C Program


Bresenhams circle generation algorithm

You might also be interested in 

DDA Line Generation Algorithm
Mid-Point Circle Generation Algorithm
Infix to Prefix ConversionInfix to Postfix Conversion
Bubble Sort
Insertion Sort
Selection sort
Shell Sort


Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)

We first revers…

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.

now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.


Home Page