Scribd
Upload
34 views9 pages

Bresenham S Circle Generating Algorithm

Bresenham's circle generating algorithm is utilized for the scan conversion of circles by leveraging the circle's symmetric properties. The algorithm focuses on drawing pixels for the first octant and then applies symmetry to complete the circle. An example demonstrates the algorithm's application by drawing a circle centered at (0,0) with a radius of 3, detailing the calculations involved in determining pixel positions.

Uploaded by

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

Bresenham S Circle Generating Algorithm

Bresenham's circle generating algorithm is utilized for the scan conversion of circles by leveraging the circle's symmetric properties. The algorithm focuses on drawing pixels for the first octant and then applies symmetry to complete the circle. An example demonstrates the algorithm's application by drawing a circle centered at (0,0) with a radius of 3, detailing the calculations involved in determining pixel positions.

Uploaded by

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

Welcome To

Computer
Science Hub
Bresenham’s
Circle
Generating
Algorithm
Basics

– Bresenham’s circle generating algorithm is used for scan conversion of


circles
– It uses the symmetric property of circle
– 3600circle can be divided in to 8 octants each of 450
– we use the algorithm to draw pixels for the first octant only
– Then using symmetry all others pixel positions are drawn
Bresenham’s circle drawing

Decision parameter
Algorithm
Plot8points?
Example
Draw a circle with center=(0,0) and radius=3
• Xc=0 ,Yc=0 , r=3
• Assign X=0, y=r→y=3
• Initial value of p=3-2r →3-2*3 =-3 p=-3

X Y P Coordinates Calculations
0 3 -3 (0,3),(3,0),(0,-3),(-3,0) P<0→p=p+4x+6→-3+4*0+6= 3,x=x+1→1
1 3 3 (1,3),(3,1),(1,-3),(3,-1),(-1,3),(-3,1),(-3,-1),(-1,-3) P>0→p=p+4(x-y)+10→3+4(1-3)+10=5,y=y-1→2
X=x+1→2
2 2 5 (2,2),(2,-2),(-2,2),(-2,-2) Endpoint reached.x=y
4 Y-Values
3

0
-4 -3 -2 -1 0 1 2 3 4
-1

-2

-3

-4

You might also like