CGMM | Bresenham's Circle Drawing Algorithm | Exp - 5
Bresenham's Circle Drawing Algorithm in Computer Graphics
Bresenham's Circle Drawing Algorithm is similar to Mid Point 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 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.
For more info visit GeeksforGeeks
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 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.
For more info visit GeeksforGeeks
Problem Statement
For a design of some graphics objects draw a circle which takes inputs as center point and radius and it calculates all points on circumference of circle using midpoint Bresenham’s Circle drawing algorithm. What difference you will observe in Bresenham’s and midpoint circle drawing algorithm
File: Download here
No comments: