An Efficient Ellipse-Drawing Algorithm

@article{VanAken1984AnEE,
  title={An Efficient Ellipse-Drawing Algorithm},
  author={Jerry Van Aken},
  journal={IEEE Computer Graphics and Applications},
  year={1984},
  volume={4},
  pages={24-35}
}
Low-cost PCs and workstations with bit-mapped graphics possess limited processing power. As a result, efficient algorithms are needed to draw curves interactively. 

Figures and Tables from this paper

Getting raster ellipses right
A concise, incremental algorithm for raster approximations to ellipses in standard position produces approximations that are good to the last pixel even near octant boundaries or the thin ends of
Drawing lines by uniform packing
TLDR
A new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line, which takes logarithmic time.
Curve-drawing algorithms for Raster displays
TLDR
The midpoint method for deriving efficient scan-conversion algorithms to draw geometric curves on raster displays is compared with the two-point method used by Bresenham, and is seen to be more accurate in the general case, without increasing the amount of computation required.
Drawing Lines and Conic Sections using Method of Deviation
Method of deviation was introduced in [1] for drawing implicit curves. This paper develops algorithms for drawing lines and conic sections using method of deviation. All computations are performed in
An Analysis of Scan Converting a Line with Multi Symmetry
TLDR
An algorithm is analyzed and discussed that exploits the multi symmetry present in certain line segments during scan conversion with the simple technique of direct line equation; digital differentiation analyzer (DDA) algorithm and the floating-point operation free Bresenham’s Algorithm.
Requirements for a VLSI Graphics Processor
This article will discuss issues that must be considered in the design of a VLSI (very large scale integration) 32-bit microprocessor specialized for graphics applications. With a properly chosen
STREAMLINING CURVE-FITTING ALGORITHMS THAT INVOLVE VECTOR-TO-RASTER CONVERSION
Curve drawing in automated cartographic applications traditionally consists of the following sequence of operations when raster or dot plotters are used to produce the maps or when the map is
Fast algorithms for rendering cubic curves
We present two integer-only algorithms to be used in tandem for rendering cubic functions and parametric cubic curves with rational coefficients. Analysis of execution speed of existing algorithms
There Is No Royal Road to Programs A Trilogy on Raster Ellipses and Programming Methodology
Wherein, with some insight, some formality and some scorn, ellipse-drawing algorithms, which had been wont unpredictably to stray by a pixel here and there, are brought to heel. The flawed designs of
Algorithms for Rendering Cubic Curves
TLDR
Two integer-only algorithms to be used in tandem for rendering cubic functions and parametric cubic curves with rational coefficients and how to take advantage of curve shape to improve algorithm performance are presented.
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
A linear algorithm for incremental digital display of circular arcs
TLDR
Methodology for producing dot or step patterns closest to the true circle, which can be drawn on an incremental display device such as a cathode ray tube, digital plotter, or matrix printer.
Circle generators for display devices
Abstract Simple methods of generating digital approximations to circles and other types of curves are described.
Algorithm for Computer Control of a Digital Plotter
An algorithm is given for computer control of a digital plotter. The algorithm may be programmed without multiplication or division instructions and is efficient with respect to speed of execution
Incremental Curve Generation
TLDR
The nonparametric representation of the curve, which is widely used since it lends itself to realization by ordinary DDA technique, is shown to be fully competitive.
An Improved Algorithm for the Generation of Nonparametric Curves
TLDR
This paper develops a direct implementation of a nonparametric representation of a curve, f(x, y) = 0, that allows steps to be taken to any point adjacent to the current one, and uses decision variables closely related to an error criterion.