Bresenham’s Circle Drawing Algorithm
1. Insert the radius r of the circle.
2. Initialize the decision variable d=3-(2*r)
3. x=0, y=r then (x0, y0)= (0,r)
4. If we are using octant symmetric to plot the pixel then until (x< y)
2. Initialize the decision variable d=3-(2*r)
3. x=0, y=r then (x0, y0)= (0,r)
4. If we are using octant symmetric to plot the pixel then until (x< y)
if(d< 0) then
d=d+4x+6
x=x-1
else
d=d+4(x-y)+10
y=y-1
x=x+1
5. Plot(x,y)
6. Determine the symmetric points the other octants also.
7. STOP
Recommended Posts:
Computer Graphics
1. Display Devices in Graphics
2. Raster Scan Display
3. Random Scan Display
4. Input Devices
5. Output Devices
6. Types of Printer
7. Pixel and Resolution in Graphics
8. Aspect Ratio
9. Refresh Rate and Interlacing
10. Digital Differential Analyzer (DDA) Algorithm
11. Bresenham’s Line Algorithm
12. Bresenham’s Circle Drawing Algorithm
13. Difference Between DDA and Bresenham’s Line Algorithm
14. MidPoint Circle Drawing Algorithm
15. Anti-Aliasing in Graphics
