[go: up one dir, main page]
Scribd
Upload
309 views2 pages

Bresenham Circle

Bresenham's circle drawing algorithm calculates the locations of pixels along an arc to draw a circle on a computer screen using discrete pixels. It works by dividing the circle into 8 equal octants and calculating pixel locations starting from the initial point (0, r) in the first quadrant up to where x = y at 45 degrees. At each point (x, y), it uses a decision parameter d to determine whether the next pixel should be (x+1, y) or (x+1, y-1) to best approximate the circle. This algorithm is simple to implement but has issues with accuracy and is not suitable for complex graphics.

Uploaded by

habtamu mesfin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
309 views2 pages

Bresenham Circle

Bresenham's circle drawing algorithm calculates the locations of pixels along an arc to draw a circle on a computer screen using discrete pixels. It works by dividing the circle into 8 equal octants and calculating pixel locations starting from the initial point (0, r) in the first quadrant up to where x = y at 45 degrees. At each point (x, y), it uses a decision parameter d to determine whether the next pixel should be (x+1, y) or (x+1, y-1) to best approximate the circle. This algorithm is simple to implement but has issues with accuracy and is not suitable for complex graphics.

Uploaded by

habtamu mesfin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Bresenham’s circle drawing algorithm

It is not easy to display a continuous smooth arc on the computer screen as our computer
screen is made of pixels organized in matrix form. So, to draw a circle on a computer
screen we should always choose the nearest pixels from a printed pixel so as they could
form an arc. There are two algorithm to do this:
1. Mid-Point circle drawing algorithm
2. Bresenham’s circle drawing algorithm
We have already discussed the Mid-Point circle drawing algorithm in our previous post.In
this post we will discuss about the Bresenham’s circle drawing algorithm.
Both of these algorithms uses the key feature of circle that it is highly symmetric. So, for
whole 360 degree of circle we will divide it in 8-parts each octant of 45 degree. In order to
do that we will use Bresenham’s Circle Algorithm for calculation of the locations of the
pixels in the first octant of 45 degrees. It assumes that the circle is centered on the origin.
So for every pixel (x, y) it calculates, we draw a pixel in each of the 8 octants of the circle
as shown below :

Now, we will see how to calculate the next pixel location from a previously known pixel
location (x, y). 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.
 else (x+1, y) is to be chosen as next pixel.
Now to draw the circle for a given radius ‘r’ and centre (xc, yc) We will start from (0, r)
and move in first quadrant till x=y (i.e. 45 degree). We should start from listed initial
condition:
d = 3 - (2 * r)
x=0
y=r
Now for each pixel, we will do the following operations:
1. Set initial values of (xc, yc) and (x, y)
2. Set decision parameter d to d = 3 – (2 * r).

3. call drawCircle(int xc, int yc, int x, int y) function.


4. Repeat steps 5 to 8 until x < = y
5. Increment value of x.
6. If d < 0, set d = d + (4*x) + 6
7. Else, set d = d + 4 * (x – y) + 10 and decrement y by 1.
8. call drawCircle(int xc, int yc, int x, int y) function

Advantages
 It is a simple algorithm.
 It can be implemented easily
 It is totally based on the equation of circle i.e. x 2 +y2 =r2
Disadvantages
 There is a problem of accuracy while generating points.
 This algorithm is not suitable for complex and high graphic images.

You might also like