A chronological and mathematical overview of digital circle generation algorithms – introducing efficient 4- and 8-connected circles

References

• J.V. Aken, An efficient ellipse-drawing algorithm, IEEE Comput. Graph. Appl. 4 (1984), pp. 24–35. doi: 10.1109/MCG.1984.275994
   Web of Science ®Google Scholar
• E. Andres, Discrete circles, rings, and spheres, Comput, Graph. 18 (1994), pp. 695–706. doi: 10.1016/0097-8493(94)90164-3
   Web of Science ®Google Scholar
• E. Andres and M.A. Jacob, The discrete analytical hyperspheres, IEEE Trans. Visual. Comput. Graph. 3 (1997), pp. 75–86. doi: 10.1109/2945.582354
   Web of Science ®Google Scholar
• E. Andres and T. Roussillon, 16th IAPR international conference on, Discrete Geometry for Computer Imagery, Nancy, France, 2011.
   Google Scholar
• N.I. Badler, Disk generators for a raster display device, Comput. Graph. Image Process. 6 (1977), pp. 589–593. doi: 10.1016/S0146-664X(77)80018-X
   Google Scholar
• J. Blinn, How many ways can you draw a circle? IEEE Comput. Graph. Appl. 7 (1987), pp. 39–44, http://dx.doi.org/10.1109/MCG.1987.276918.
   Web of Science ®Google Scholar
• J.E. Bresenham, Algorithm for computer control of a digital plotter, IBM Syst. J. 4 (1965), pp. 25–30. doi: 10.1147/sj.41.0025
   Google Scholar
• J. Bresenham, A linear algorithm for incremental digital display of circular arcs, Commun. ACM 20 (1977), pp. 100–106, http://doi.acm.org/10.1145/359423.359432.
   Web of Science ®Google Scholar
• J. Bresenham, Keynote Speech: The 11th international conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2003, 2003, pp. 1–3.
   Google Scholar
• J.E. Bresenham, D.G. Grice, and S.C. Pi, Bi-directional display of circular arcs, 1983. Available at http://www.google.com/patents/US4371933.
   Google Scholar
• W.L. Chung, On circle generation algorithms, Comput. Graph. Image Process. 6 (1977), pp. 196–198. doi: 10.1016/S0146-664X(77)80012-9
   Google Scholar
• P.-E. Danielsson, Comments on circle generator for display devices, Comput. Graph. Image Process. 7 (1978), pp. 300–301. doi: 10.1016/0146-664X(78)90120-X
   Google Scholar
• E. Denert, A method for computing points of a circle using only integers, Comput. Graph. Image Process. 2 (1973), pp. 83–91. doi: 10.1016/0146-664X(73)90033-6
   Google Scholar
• M. Doros, Algorithms for generation of discrete circles, rings, and disks, Comput. Graph. Image Process. 10 (1979), pp. 366–371. doi: 10.1016/S0146-664X(79)80044-1
   Google Scholar
• R. Earnshaw (ed.), Fundamental Algorithms for Computer Graphics, NATO ASI Series: Computer and Systems Sciences, Springer-Verlag, Berlin, Heidelberg, 1985, pp. 197–217.
   Google Scholar
• J. Foley and A. van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley, Boston, MA, 1982, pp. 441–446.
   Google Scholar
• J.D. Foley, A.V. Dam, S.K. Feiner, and J.F. Hughes, Computer Graphics – Principles and Practice, Addition Wesley, Boston, MA, 1990, pp. 81–87.
   Google Scholar
• H. Freeman, Techniques for the Digital Computer Analysis of Chain-Encoded Arbitrary Plane Curves, Proc. Nat. Electronics. Conf., Chicago, Vol. 17, 1961, pp. 412–432.
   Google Scholar
• D. Hearn and M.P. Baker, Computer Graphics, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ, 1994.
   Google Scholar
• F.J. Hill, Computer Graphics, Macmillan Pub Co, New York, 1990, pp. 433–436.
   Google Scholar
• B.K.P. Horn, Circle generators for display devices, Comput. Graph. Image Process. 5 (1976), pp. 280–288. doi: 10.1016/0146-664X(76)90036-8
   Google Scholar
• B.K.P. Horn, Comment on: ‘a note on the paper … ’, Comput. Graph. Image Process. 9 (1979), pp. 104. doi: 10.1016/0146-664X(79)90088-1
   Google Scholar
• W. Isaacson, Steve Jobs, Simon & Schuster, 2011, p. 225, http://books.google.se/books?id=I6R8MXStPXgC.
   Google Scholar
• C.E. Kim, Digital convexity, straightness, and convex polygons, IEEE Trans. Pattern Anal. Mach. Intell. 4 (1982), pp. 618–626. doi: 10.1109/TPAMI.1982.4767315
   PubMed Web of Science ®Google Scholar
• Z. Kulpa, A note on ‘circle generator for display devices’, Comput. Graph. Image Process. 9 (1979), pp. 102–103. doi: 10.1016/0146-664X(79)90087-X
   Google Scholar
• R. Lachlan, An Elementary Treatise on Modern Pure Geometry, Chap. 10, Macmillian, London, (1893), p. 148, the Circle.
   Google Scholar
• P. Lappalainen and L. Ojala, A novel digital method of generating a circle test pattern for television, Radio Electron. Eng. 42 (1972), pp. 21–27. doi: 10.1049/ree.1972.0003
   Google Scholar
• P.G. McCrea and P.W. Baker, On digital differential analyzer (dda) circle generation for computer graphics, IEEE Trans. Comput. 24 (1975), pp. 1109–1110. http://dx.doi.org/10.1109/T-C.1975.224140.
   Web of Science ®Google Scholar
• P.R. Nieuwenhuizen, O. Kiewiet, and W.F. Bronsvoort, An integrated line tracking and vectorization algorithm, Comput. Graph. Forum 13 (1994), pp. 349–359. http://doi.wiley.com/10.1111/1467-8659.1330349.
   Google Scholar
• T. Paterson, Circles and the digital differential analyzer, Dr. Dobb's (DDJ) 15 (1990), pp. 30, 32, 34–35, 96.
   Google Scholar
• S. Pham, Digital circles with non-lattice point centers, Visual Comput. 9 (1992), pp. 1–24. http://dx.doi.org/10.1007/BF01901025
   Google Scholar
• M.L.V. Pitteway, Integer circles, etc.: Some further thoughts, Comput. Graph. Image Process. 3 (1974), pp. 262–265. doi: 10.1016/0146-664X(74)90020-3
   Google Scholar
• M.L.V. Pittewy and R.J. Botting, Integer circles, etc.: Three move extension of bresenham's algorithm, Comput. Graph. Image Process. 3 (1974), pp. 260–261. doi: 10.1016/0146-664X(74)90019-7
   Google Scholar
• C.V.K. Rao, Comment on a method for computing points of a circle using only integers, Comput. Graph. Image Process. 4 (1975), pp. 79. doi: 10.1016/0146-664X(75)90024-6
   Google Scholar
• J.-L. Toutant, E. Andres, and T. Roussillon, Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties, Discret. Appl. Math. 161 (2013), pp. 2662–2677. http://dx.doi.org/10.1016/j.dam.2013.06.001.
   Web of Science ®Google Scholar
• R. Zrour, G. Largeteau-Skapin, and E. Andres, Optimal Consensus Set for Annulus Fitting, in Proceedings of the 16th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI'11, Nancy, France, http://dl.acm.org/citation.cfm?id=1987119.1987154, Springer, Berlin, 2011, pp. 358–368.
   Google Scholar