![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/f/fd/Midpoint_circle_algorithm_animation_%2528radius_23%2529.gif/640px-Midpoint_circle_algorithm_animation_%2528radius_23%2529.gif&w=640&q=50)
Midpoint circle algorithm
Determines the points needed for rasterizing a circle / From Wikipedia, the free encyclopedia
In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It's a generalization of Bresenham's line algorithm. The algorithm can be further generalized to conic sections.[1][2][3]
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/f/fd/Midpoint_circle_algorithm_animation_%28radius_23%29.gif/320px-Midpoint_circle_algorithm_animation_%28radius_23%29.gif)
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/1/1d/Midpoint_circle_algorithm%2C_radius_23.png/320px-Midpoint_circle_algorithm%2C_radius_23.png)