Bresenhams Circle Drawing Solved Example

Bresenham'south Circle Drawing Algorithm in Computer Graphics

Bresenham'south algorithm is also used for circle drawing. It is known as Bresenham'southward circumvolve drawing algorithm. Information technology helps us to draw a circle. The circumvolve generation is more complicated than cartoon a line. In this algorithm, nosotros will select the closest pixel position to complete the arc. We cannot represent the continuous arc in the raster brandish system. The different part of this algorithm is that we only use arithmetic integer. We can perform the calculation faster than other algorithms.

Permit us assume we have a point p (ten, y) on the purlieus of the circle and with r radius satisfying the equation f_c (x, y) = 0

As nosotros know the equation of the circle is –

f_c (10, y) = 10^two + y² = r²

If

f_c (10, y) < 0

then

The point is within the circle boundary.

If

f_c (10, y) = 0

then

 The point is on the circumvolve boundary.

If

f_c (ten, y) > 0

then

 The point is outside the circle boundary.

Nosotros assume,

The distance betwixt point P_iii and circle purlieus = d₁

The distance betwixt point P₂ and circle purlieus = d₂

At present, if we select indicate P₃ then circle equation will be-

d₁ = (ten_k +1)² + (y_k)² – r²            {Value is +ve, because the point is outside the circle}

if we select betoken P₂ then circumvolve equation will exist-

d_ii = (x_thou +1)² + (y_yard -1)ⁱⁱ – r²{Value is -ve, because the point is inside the circumvolve}

At present, we will calculate the decision parameter (d_{one thousand}) = d₁ + d_two

d_k =(ten_{one thousand} +1)² + (y_k)² – r² + d₂ + (ten_thousand +1)² + (y_k -1)^two – r²

    = 2(ten_k +one)² + (y_k)²+ (y_k -1)² – 2r²                  …………………… (1)

If

d_k < 0

then

Point P₃ is closer to circle purlieus, and the final coordinates are-

(x_{one thousand +i}, y_k) = (ten_k +1, y_k)

If

d_k >= 0

and then

Point P_ii is closer to circle boundary, and the terminal coordinates are-

(x_{k +1}, y_thousand) = (x_{one thousand} +1, y₁₀₀₀ -ane)

Now, nosotros volition find the adjacent decision parameter (d_k+1)

(d_1000+i) = 2(x_k+1 +1)² + (y_k+1)²+ (y_k+1 -1)² – 2r²               …………………… (two)

Now, we notice the difference between decision parameter equation (two) - equation (1) (d_k+one) – (d_k) = 2(x_k+1+1)² + (y_yard+1)ⁱⁱ+ (y_k+1 –1)² – 2r² – 2(x_k +i)ⁱⁱ + (y_k)^two+ (y_k– 1)² – 2r²        (d_m+ane) = d_chiliad + 4x_k + ii(y_grand+1 ²– y₁₀₀₀ ⁱⁱ) – (y_k+i – y_k) + 6

Now, we cheque two weather condition for decision parameter-

Condition i: If

                          d_k < 0

and then

y_k+ane = y_k (Nosotros select signal P₃)

Condition 2: If

                          d_k >= 0

and so

y_grand+ane = y_thousand-1       (We select point P_three)

Now, we calculate initial decision parameter (d₀)

d₀ = d₁ + d₂

d₀ = {ane² +r²– r^two} + {1² +(r – 1)^two – r²}

d₀ =   3 – 2r

Algorithm of Bresenham'south Circle Cartoon

Stride i: Start.

Step 2: First, nosotros destine the starting coordinates (x₁, y_i) as follows-

x_one = 0

             y_i =r

Pace 3: At present, we calculate the initial decision parameter d₀ -

d₀ = three – 2 x r

Step 4: Assume,the initial coordinates are (10_k, y_k)

The next coordinates volition be (ten_k+ane, y_k+1)

At present, we will find the next point of the kickoff octant according to the value of the decision parameter (d_k).

Step 5: Now, we follow two cases-

Case 1: If

d_yard < 0

then

10_g+1 =x_m + ane

                  y_k+1 =y_thousand

                  d_m+1 = d_yard + 4x_1000+ane + 6

Case two: If

d_k >= 0

then

x_yard+1 =x_chiliad + 1

                  y_chiliad+1 =y_k –1

                  d₁₀₀₀₊₁ = d_k + four(x_g+one – y_k+1)+ 10

Pace six: If the centre coordinates (x_i, y₁) is not at the origin (0, 0), and so we will describe the points as follow-

X coordinate = ten_c + x₁

y coordinate = y_c + y₁ {10_c andy_c representsthe electric current value of ten and y coordinate}

Step 7: We repeat step 5 and vi until we get x>=y.

Step 8: Stop.

Example: The radius of a circumvolve is 8, and center betoken coordinates are (0, 0). Apply bresenham's circle drawing algorithm to plot all points of the circle.

Solution:

Step ane: The given stating points of the circumvolve (x_1, y₁) = (0, 0)

Radius of the circle (r) = 8

Pace ii: At present, we will assign the starting betoken (x_i, y_one) every bit follows-

x₁ = 0

             y_i = r (radius) = 8

Step 3: Now, we will calculate the initial determination parameter (d₀)

d₀ = three – 2 x r

          d₀ = three – 2 ten 8

          d₀ = -thirteen

Step four:The value of initial parameter d₀ < 0. So, case 1 is satisfied.

Thus,

ten_k+ane =x_k + 1 = 0 + 1 = 1

           y_k+i =y_k = 8

           d_m+one = d_yard + 4x_k+1 + 6 = -13 + (four 10 one) + 6 = -3

Step 5: The middle coordinates are already (0, 0) so we will motion to next step.

Step 6: Follow step 4 until nosotros get x >= y.

Table for all points of octant 1:

dthousand	dm+1	(xgrand+1,ychiliad+i)
		(0, 8)
­-13	-iii	(1, 8)
-3	11	(2, viii)
11	5	(3, 7)
5	vii	(4, 6)
7		(5, 5)

Now, we will calculate the coordinates of the octant 2 past swapping the 10 and y coordinates.

Coordinates of Octant i	Coordinates of Octant 2
(0, 8)	(5, v)
(one, 8)	(half dozen, 4)
(ii, 8)	(7, 3)
(3, 7)	(8, 2)
(4, vi)	(8, 1)
(5, 5)	(8, 0)

Thus, we will summate all points of the circumvolve with respect to octant one.

Quadrant 1 (x, y)	Quadrant 2 (-10, y)	Quadrant iii (-10, -y)	Quadrant four (x, -y)
(0, 8)	(0, viii)	(0, -8)	(0, -eight)
(ane, 8)	(-1, 8)	(-1, -8)	(ane, -eight)
(two, 8)	(-2, eight)	(-2, -8)	(two, -8)
(3, seven)	(-three, 7)	(-three, -vii)	(3, -7)
(4, 6)	(-4, six)	(-four, -6)	(four, -vi)
(5, 5)	(-5, v)	(-5, -v)	(5, -5)
(half dozen, 4)	(-half dozen, iv)	(-half-dozen, -4)	(six, -iv)
(7, 3)	(-7, 3)	(-seven, -iii)	(7, -3)
(8, 2)	(-8, two)	(-8, -two)	(viii, -2)
(8, 1)	(-8, 1)	(-viii, -i)	(eight, -ane)
(8, 0)	(-8, 0)	(-8, 0)	(8, 0)

Advantages of Bresenham'due south Circle Drawing Algorithm

• It is simple and easy to implement.
• The algorithm is based on unproblematic equation ten² + y² = r^two.

Disadvantages of Bresenham'south Circle Drawing Algorithm

• The plotted points are less authentic than the midpoint circle drawing.
• It is not then skillful for complex images and high graphics images.

• Bresenham'southward Line Drawing Algorithm in Computer Graphics
• Line Drawing Algorithm in Computer Graphics
• Mid-Point Line Drawing Algorithm in Reckoner Graphics
• Midpoint Circumvolve Drawing Algorithm in Computer Graphics
• DDA line Drawing Algorithm in Reckoner Graphics
• Line Clipping in Figurer Graphics
• Animation in Reckoner Graphics
• Epitome Representation in Figurer Graphics
• Pointing and Positioning Technique Computer Graphics
• Scan Conversion of a Circumvolve Computer Graphics

hyderthatirly66.blogspot.com

Source: https://www.tutorialandexample.com/bresenhams-circle-drawing-algorithm

Share this post