Question

Difference between bresenham and midpoint circle drawing algorithm

Answer 1

Bresenham algorithm : it is the optimized form of midpoint circle . it only deals with integers because of which it consume less time as well as the memory. this type of algorithm is efficient and accurate too because it prevents from calculation of floating point.

Midpoint circle algorithm:
it prevents trigonometric calculations and only use adopting integers. It checks the nearest possible integers  with the help of midpoint  of pixels oon the circle. But it still needs to use the floating point calculations. 

Answer 2

Bresenham's line algorithm determines the points of a raster that have to be selected to form an approximate straight line between two points. It is used in a bitmap image to draw line primitives. It uses integer addition, bit shifting and subtraction which are cheap operations in computer architectures. It is one of the earliest algorithms and is important even in the present because of its speed and simplicity. It's extension can be used for drawing circles.

Midpoint circle algorithm is used in computer graphics to determine the points required for rasterizing a circle. The Bresenham's circle algorithm is derived from it. The midpoint circle algorithm may be generalized to conic sections.