An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm

03/06/2021
by   Dr. M. Javed Idrisi, et al.
0

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.

READ FULL TEXT

page 6

page 7

page 8

page 9

page 10

page 11

research
12/11/2018

Bundled Crossings Revisited

An effective way to reduce clutter in a graph drawing that has (many) cr...
research
02/05/2020

Hybrid CUR-type decomposition of tensors in the Tucker format

The paper introduces a hybrid approach to the CUR-type decomposition of ...
research
08/27/2022

An FPT Algorithm for Bipartite Vertex Splitting

Bipartite graphs model the relationship between two disjoint sets of obj...
research
09/03/2018

The Weighted Barycenter Drawing Recognition Problem

We consider the question of whether a given graph drawing Γ of a triconn...
research
06/09/2023

Federated Learning You May Communicate Less Often!

We investigate the generalization error of statistical learning models i...
research
03/04/2020

Rethinking Parameter Counting in Deep Models: Effective Dimensionality Revisited

Neural networks appear to have mysterious generalization properties when...
research
01/10/2013

Plausible reasoning from spatial observations

This article deals with plausible reasoning from incomplete knowledge ab...

Please sign up or login with your details

Forgot password? Click here to reset