Analytical Description of Digital Circles

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.

[1]  Laure Tougne,et al.  An elementary algorithm for digital arc segmentation , 2001, Electron. Notes Theor. Comput. Sci..

[2]  N. Megiddo,et al.  Computing circular separability , 1986 .

[3]  Eric Andres,et al.  The supercover of an m-flat is a discrete analytical object , 2008, Theor. Comput. Sci..

[4]  Mohamed Tajine,et al.  Hausdorff Discretizations of Algebraic Sets and Diophantine Sets , 2000, DGCI.

[5]  Eric Andres,et al.  The Discrete Analytical Hyperspheres , 1997, IEEE Trans. Vis. Comput. Graph..

[6]  Chul E. Kim,et al.  Digital disks and a digital compactness measure , 1984, STOC '84.

[7]  Eric Andres.  Discrete linear objects in dimension n: the standard model , 2003, Graph. Model..

[8]  Peter Sauer,et al.  On the Recognition of Digital Circles in Linear Time , 1993, Comput. Geom..

[9]  Gaëlle Largeteau-Skapin,et al.  Optimal Consensus Set for Annulus Fitting , 2011, DGCI.

[10]  V. Kovalevsky,et al.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[11]  Chul E. Kim,et al.  Digital Disks , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Alon Efrat,et al.  Subpixel image registration using circular fiducials , 1994, Int. J. Comput. Geom. Appl..

[13]  Marcel Worring,et al.  Digitized Circular Arcs: Characterization and Parameter Estimation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Charles Albert Wüthrich,et al.  Towards A Unified Approach Between Digitizations of Linear Objects And Discrete Analytical Objects , 2000, WSCG.

[15]  Micha Sharir,et al.  Efficient randomized algorithms for some geometric optimization problems , 1995, SCG '95.

[16]  Peter Damaschke.  The linear time recognition of digital arcs , 1995, Pattern Recognit. Lett..

[17]  M. Douglas McIlroy,et al.  Best approximate circles on integer grids , 1983, TOGS.

[18]  Steve Fisk.  Separating Point Sets by Circles, and the Recognition of Digital Disks , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Jean-Pierre Reveillès,et al.  Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

[20]  Eric Andres,et al.  Discrete circles, rings and spheres , 1994, Comput. Graph..

[21]  Zenon Kulpa,et al.  Freeman digitization of integer circles minimizes the radial error , 1981 .

[22]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[23]  Akira Nakamura,et al.  Digital circles , 1984, Comput. Vis. Graph. Image Process..

[24]  Son Pham.  Digital circles with non-lattice point centers , 2005, The Visual Computer.

[25]  Christophe Fiorio,et al.  Discrete circles: an arithmetical approach with non-constant thickness , 2006, Electronic Imaging.

[26]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[27]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.