An efficient algorithm to scan conversion of ellipse under auxiliary circle

Abstract

Midpoint ellipse algorithm is one of the popular algorithms for ellipse drawing. Midpoint algorithm is little complex as it divides the first quadrant in to two regions and then develops recursive equation to find the next pixel for each of the regions. This big size calculation and different equations increases the computational complexity of the algorithm. The proposed algorithm in this paper computes the pixels only in one octant and remaining part of the auxiliary circle can be generated by reflection about line $y=x$, with the help of the parametric equation of the ellipse we can determine all the pixels on ellipse.