An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929482737123328 |
|---|---|
| author | Idrisi, M. Javed Ashraf, Aayesha |
| author_facet | Idrisi, M. Javed Ashraf, Aayesha |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2103_04033 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm Idrisi, M. Javed Ashraf, Aayesha Graphics 68Wxx I.3 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. |
| title | An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm |
| topic | Graphics 68Wxx I.3 |
| url | https://arxiv.org/abs/2103.04033 |