  The present paper deals with the generalization of Midpoint Ellipse Drawing
Algorithm (MPEDA) to minimize the error in the existing MPEDA in cartesian
form. In this method, we consider three different values of h, i.e., 1, 0.5 and
0.1. For h = 1, all the results of MPEDA have been verified. For other values
of h it is observed that as the value of h decreases, the number of iteration
increases but the error between the points generated and the original ellipse
points decreases and vice-versa.
