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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
