Abstract
By much the same methodology as is employed in algorithms which generate a quantized representation of a straight line, incremental algorithms using only addition/subtraction and sign testing can generate a close approximation of a circular arc. Several mathematical measures of ‘closeness’ to the true circle can be defined. Discussed will be closeness measures of function residue or squared error, normal deviation or radial error, and rounded or axial intercept error as they apply to both a tri-directional and a bi-directional algorithm for pel by pel generation of a quantized circular arc.
The original paper on which this discussion is based is: A Linear Algorithm for Incremental Digital Display of Circular Arcs. Jack Bresenham. Communications of the ACM 20 (No. 2) p100–106 (February, 1977)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bresenham, J.E. (1985). Algorithms for Circular Arc Generation. In: Earnshaw, R.A. (eds) Fundamental Algorithms for Computer Graphics. NATO ASI Series, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84574-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-84574-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54397-8
Online ISBN: 978-3-642-84574-1
eBook Packages: Springer Book Archive