A chronological and mathematical overview of digital circle generation algorithms – introducing efficient 4- and 8-connected circles. Issue 8 (2nd August 2016)

• Record Type: Journal Article
• Authors: Barrera, T.; Hast, A.; Bengtsson, E.
• Is Part Of: International journal of computer mathematics. Volume 93:Issue 8(2016)
• Page Start: 1241
• Page End: 1253
• Publication Date: 2016-08-02
• Subjects: digital circle drawing -- all integer arithmetic -- connectivity -- Bresenham -- midpoint and Michener circle; 65S05 -- 68U05; Computers -- Periodicals; Numerical analysis -- Periodicals; Automation -- Periodicals; 004.0151
• DOI: 10.1080/00207160.2015.1056170
• Languages: English
• ISSNs: 0020-7160

Abstract

Abstract : Circles are one of the basic drawing primitives for computers and while the naive way of setting up an equation for drawing circles is simple, implementing it in an efficient way using integer arithmetic has resulted in quite a few different algorithms. We present a short chronological overview of the most important publications of such digital circle generation algorithms. Bresenham is often assumed to have invented the first all integer circle algorithm. However, there were other algorithms published before his first official publication, which did not use floating point operations. Furthermore, we present both a 4- and an 8-connected all integer algorithm. Both of them proceed without any multiplication, using just one addition per iteration to compute the decision variable, which makes them more efficient than previously published algorithms.