Abstract
Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this paper, we present a new algorithm for the construction of digital circles on the integer lattice \(\mathbb {Z}^2\), which makes sole use of the signum function. By briefly elaborating on the nature of discretization of circular paths, we then find that this algorithm recovers, in a space endowed with \(\ell ^1\)-norm, the defining constant \(\pi \) of a circle in \(\mathbb {R}^2\).
Similar content being viewed by others
References
Andres, E.: Discrete circles, rings and spheres. Comput. Graph. 18(5), 695–706 (1994)
Apostol, T.M.: Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics. Springer, New York (1995)
Barrera, T., Hast, A., Bengtsson, E.: A chronological and mathematical overview of digital circle generation algorithms–introducing efficient 4- and 8-connected circles. Int. J. Comput. Math. 93(8), 1241–1253 (2016)
Bhowmick, P., Bhattacharya, B.B.: Approximation of digital circles by regular polygons. In: Pattern Recognition and Data Mining (ICAPR’05). Lecture Notes in Computer Science, vol. 3686, pp. 257–267. Springer, Berlin (2005)
Bhowmick, P., Bhattacharya, B.B.: Number-theoretic interpretation and construction of a digital circle. Discrete Appl. Math. 156(12), 2381–2399 (2008)
Biswas, S.N., Chaudhuri, B.B.: On the generation of discrete circular objects and their properties. Comput. Vis. Graph. Image Process. 32(2), 158–170 (1985)
Bresenham, J.E.: A linear algorithm for incremental digital display of circular arcs. Commun. ACM 20(2), 100–106 (1977)
Chen, L.M.: Digital and Discrete Geometry. Springer, Cham (2014)
Doros, M.: Algorithms for generation of discrete circles, rings, and disks. Comput. Graphics Image Process. 10(4), 366–371 (1979)
Foley, J.D., van Dam, A.: Fundamentals of Interactive Computer Graphics. Addison-Wesley, Boston pp. 441–446. (1982)
Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice. Addison-Wesley, Boston pp. 81–87. (1990)
Gauthier, Y.: Internal Logic: Foundations of Mathematics from Kronecker to Hilbert. Springer, Dordrecht (2002)
Goldapp, M.: Approximation of circular arcs by cubic polynomials. Comput. Aided Geom. Des. 8(3), 227–238 (1991)
Gradshteyn, I.S., Ryzhik, I.M.: Table of Integrals, Series, and Products, 7th edn. Elsevier, Amsterdam (2007)
Holin, H.: Harthong–Reeb analysis and digital circles. Visual Comput. 8(1), 8–17 (1991)
Horn, B.K.P.: Circle generators for display devices. Comput. Graphics Image Process. 5, 280–288 (1976)
Hosur, P.I., Ma, K.-K.: A novel scheme for progressive polygon approximation of shape contours. In: IEEE Proceedings of the 3rd Workshop on Multimedia Signal Processing, pp. 309–314 (1999)
Huxley, M.N.: Area, Lattice Points, and Exponential Sums. London Mathematical Society Monographs (N.S.), vol. 13. The Clarendon Press, Oxford (1996)
Kim, C.E., Anderson, T.A.: Digital disks and a digital compactness measure. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC’84), ACM, New York pp. 117–124 (1984)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Image Analysis. The Morgan Kaufmann Series in Computer Graphics. Morgan Kaufmann, San Diego (2004)
Krause, E.F.: Taxicab Geometry. Dover Books on Mathematics. Dover, New York (1987)
Kulpa, Z.: On the properties of discrete circles, rings, and disks. Comput. Graphics Image Process. 10(4), 348–365 (1979)
McIlroy, M.D.: Best approximate circles on integer grids. ACM Trans. Graph. 2(4), 237–263 (1983)
Nakamura, A., Aizawa, K.: Digital circles. Comput. Vis. Graph. Image Process. 26(2), 242–255 (1984)
Pham, S.: Digital circles with non-lattice point centers. Visual Comput. 9(1), 1–24 (1992)
Piegl, L., Tiller, W.: A menagerie of rational B-spline circles. IEEE Comput. Graph. Appl. 9(5), 48–56 (1989)
Rudolph-Lilith, M.: Pi visits Manhattan. arXiv:1708.00766 [math.HO], http://arxiv.org/abs/1708.00766 (2017)
Wu, X., Rokne, J.G.: Double-step incremental generation of lines and circles. Comput. Vis. Graph. Image Process. 37(3), 331–344 (1987)
http://mrudolphlilith.github.io/publications/Peer-Reviewed Articles/A36/A36.html
Acknowledgements
Research supported by CNRS. This project has received funding from the European Union’s Horizon 2020 Framework Programme for Research and Innovation under Grant Agreement No. 720270 (Human Brain Project SGA1). The author wishes to thank L.S. Dee, J. Antolik, D. Holstein, J.A.G. Willow, S. Hower and C.O. Cain for valuable discussions and comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Kenneth Clarkson
Rights and permissions
About this article
Cite this article
Rudolph-Lilith, M. On a Recursive Construction of Circular Paths and the Search for \(\pi \) on the Integer Lattice \(\mathbb {Z}^2\) . Discrete Comput Geom 59, 643–662 (2018). https://doi.org/10.1007/s00454-017-9930-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-017-9930-7