An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm
M. Javed Idrisi, Aayesha Ashraf

TL;DR
This paper generalizes the Midpoint Ellipse Drawing Algorithm to reduce errors by adjusting step sizes, demonstrating that smaller steps decrease error but increase iterations.
Contribution
It introduces a generalized MPEDA with variable step sizes to minimize error in ellipse drawing, improving accuracy over the traditional method.
Findings
Smaller step size h reduces drawing error.
Decreasing h increases the number of iterations.
The method effectively minimizes error in ellipse rendering.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Mechanisms and Dynamics · Advanced Numerical Analysis Techniques · Optical measurement and interference techniques
