Abstract
In this paper we propose an analytical description of different kinds of digital circles that appear in the literature and especially in digital circle recognition algorithms.
Chapter PDF
References
Agarwal, P.K., Sharir, M.: Efficient randomized algorithms for some geometric optimization problems. In: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pp. 326–335 (1995)
Andres, E.: Discrete circles, rings and spheres. Computer and Graphics 18(5), 695–706 (1994)
Andres, E.: Modélisation Analytique Discrète d’Objets Géométriques. Habilitation à diriger des recherches, Université de Poitiers (2000)
Andres, E.: Discrete linear objects in dimension n: the standard model. Graphical Models 65(1-3), 92–111 (2003)
Andres, E.: The supercover of an m-flat is a discrete analytical object. TCS 406(1-2), 8–14 (2008), http://www.sciencedirect.com/science/article/B6V1G-4T4J88B-2/2/4101ff67ac5a1fb9c8028c53147a5218 , discrete Tomography and Digital Geometry: In memory of Attila Kuba
Andres, E., Jacob, M.A.: The discrete analytical hyperspheres. IEEE Transactions on Visualization and Computer Graphics 3(1), 75–86 (1997)
Bresenham, J.: A linear algorithm for incremental digital display of circular arcs. Communications of the ACM 20(2), 100–106 (1977)
Coeurjolly, D., Gérard, Y., Reveillès, J.P., Tougne, L.: An Elementary Algorithm for Digital Arc Segmentation. Discrete Applied Math. 139(1-3), 31–50 (2004)
Damaschke, P.: The Linear Time Recognition of Digital Arcs. Pattern Recognition Letters 16, 543–548 (1995)
Efrat, A., Gotsman, C.: Subpixel Image Registration Using Circular Fiducials. Int. Journal of Computational Geometry & Applications 4(4), 403–422 (1994)
Fiorio, C., Jamet, D., Toutant, J.L.: Discrete circles: an arithmetical approach with non-constant thickness. In: Vision Geometry XIV, Electronic Imaging, SPIE, vol. 6066, pp. 60660C.1–60660C.12 (2006)
Fisk, S.: Separating Points Sets by Circles, and the Recognition of Digital Disks. IEEE Transactions on Pattern Analysis and Machine Intelligence 8, 554–556 (1986)
Kim, C.E.: Digital Disks. IEEE Transactions on Pattern Analysis and Machine Intelligence 6(3), 372–374 (1984)
Kim, C.E., Anderson, T.A.: Digital Disks and a Digital Compactness Measure. In: Annual ACM Symposium on Theory of Computing, pp. 117–124 (1984)
Kovalevsky, V.A.: New Definition and Fast Recognition of Digital Straight Segments and Arcs. In: Internation Conference on Pattern Analysis and Machine Intelligence, pp. 31–34 (1990)
Kulpa, Z., Doros, M.: Freeman digitization of integer circles minimizes the radial error. Computer Graphics and Image Processing 17(2), 181–184 (1981)
Lincke, C., Wüthrich, C.A.: Towards a unified approach between digitization of linear objects and discrete analytical objects. In: WSGG 2000, University of West Bohemia, Plzen Tcheque Republic, pp. 124–131 (2000)
McIlroy, M.D.: Best approximate circles on integer grids. ACM Transactions on Graphics 2(4), 237–263 (1983)
Megiddo, N.: Linear Programming in Linear Time When the Dimension Is Fixed. SIAM Journal on Computing 31, 114–127 (1984)
Nakamura, A., Aizawa, K.: Digital Circles. Computer Vision, Graphics, and Image Processing 26(2), 242–255 (1984)
O’Rourke, J., Kosaraju, S.R., Meggido, N.: Computing Circular Separability. Discrete and Computational Geometry 1, 105–113 (1986)
Pham, S.: Digital Circles With Non-Lattice Point Centers. The Visual Computer 9, 1–24 (1992)
Reveillès, J.P.: Géométrie Discrète, calculs en nombres entiers et algorithmique. Thèse d’etat, Université Louis Pasteur (1991)
Sauer, P.: On the Recognition of Digital Circles in Linear Time. Computational Geometry 2(5), 287–302 (1993)
Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete and Computational Geometry 6(1), 423–434 (1991)
Tajine, M., Ronse, C.: Hausdorff discretizations of algebraic sets and diophantine sets. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 99–110. Springer, Heidelberg (2000), http://portal.acm.org/citation.cfm?id=648319.754197
Worring, M., Smeulders, A.W.M.: Digitized Circular Arcs: Characterization and Parameter Estimation. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(6), 554–556 (1995)
Zrour, R., Largeteau-Skapin, G., Andres, E.: Optimal Consensus set for Annulus Fitting. In: Debled-Rennesson, I., et al. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 238–249. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andres, E., Roussillon, T. (2011). Analytical Description of Digital Circles. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19867-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-19867-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19866-3
Online ISBN: 978-3-642-19867-0
eBook Packages: Computer ScienceComputer Science (R0)