Computer Graphics-drawing Algorithms
Computer Graphics-drawing Algorithms
Y = mx + b
These Algorithm
In addition, We must determine the slope (m) between the starting point
and the final point in Bresenham’s Line Drawing procedure.
BRESENHAM LINE 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 :
C I RC L E D RAW I N G A L G O R I T H M
C I RC L E D RAW I N G A L G O R I T H M
Advantages
•It is a simple algorithm.
Disadvantages
•There is a problem of accuracy while generating points.
•This algorithm is not suitable for complex and high graphic images.
T H A N K YO U
Brita Tamm
502-555-0152
www.firstupconsultants.com