J. P. Reveilì-es, Géométrie Discrète, calculs en nombres entiers et algorithmique, Thèse d'etat, 1991.

E. Andres, The supercover of an m-flat is a discrete analytical object, Theoretical Computer Science, vol.406, issue.1-2, pp.8-14, 2008.
DOI : 10.1016/j.tcs.2008.07.025
URL : https://hal.archives-ouvertes.fr/hal-00354197

E. Andres and M. A. Jacob, The discrete analytical hyperspheres, IEEE Transactions on Visualization and Computer Graphics, vol.3, issue.1, pp.75-86, 1997.
DOI : 10.1109/2945.582354

P. K. Agarwal and M. Sharir, Efficient randomized algorithms for some geometric optimization problems, Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pp.326-335, 1995.

R. Zrour, G. Largeteau-skapin, and E. , Andres: Optimal Consensus set for Annulus Fitting, this proceedings, 2011.
DOI : 10.1007/978-3-642-19867-0_30
URL : http://hal.archives-ouvertes.fr/docs/00/71/36/74/PDF/reco_en_anglais.pdf

C. Lincke and C. A. Wüthrich, Towards a unified approach between digitization of linear objects and discrete analytical objects, pp.124-131, 2000.

A. Nakamura and K. Aizawa, Digital Circles. Computer vision, graphics, and image processing, pp.242-255, 1984.
DOI : 10.1016/0734-189x(83)90077-4

E. Andres, Discrete linear objects in dimension n: the standard model, Graphical Models, vol.65, issue.1-3, pp.92-111, 2003.
DOI : 10.1016/S1524-0703(03)00004-3
URL : https://hal.archives-ouvertes.fr/hal-00354729

V. A. Kovalevsky, New definition and fast recognition of digital straight segments and arcs, [1990] Proceedings. 10th International Conference on Pattern Recognition, pp.31-34, 1990.
DOI : 10.1109/ICPR.1990.119324

E. Andres, Modélisation Analytique Discrète d'Objets Géométriques. Habilitationà Habilitation`Habilitationà diriger des recherches, 2000.

J. Bresenham, A linear algorithm for incremental digital display of cirucular arcs, Communications of the ACM, vol.20, issue.2, pp.100-106, 1977.
DOI : 10.1145/359423.359432

M. D. Mcilroy, Best approximate circles on integer grids, ACM Transactions on Graphics, vol.2, issue.4, pp.237-263, 1983.
DOI : 10.1145/245.246

Z. Kulpa and M. Doros, Freeman digitization of integer circles minimizes the radial error, Computer Graphics and Image Processing, vol.17, issue.2, pp.181-184, 1981.
DOI : 10.1016/0146-664X(81)90025-3

S. Pham, Digital circles with non-lattice point centers, The Visual Computer, vol.15, issue.1, pp.1-24, 1992.
DOI : 10.1007/BF01901025

E. Andres, Discrete circles, rings and spheres, Computers & Graphics, vol.18, issue.5, pp.695-706, 1994.
DOI : 10.1016/0097-8493(94)90164-3

P. Sauer, On the recognition of digital circles in linear time, Computational Geometry, vol.2, issue.5, pp.287-302, 1993.
DOI : 10.1016/0925-7721(93)90025-2

P. Damaschke, The linear time recognition of digital arcs, Pattern Recognition Letters, vol.16, issue.5, pp.543-548, 1995.
DOI : 10.1016/0167-8655(95)00127-3

S. Fisk, Separating Point Sets by Circles, and the Recognition of Digital Disks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.8, issue.4, pp.554-556, 1986.
DOI : 10.1109/TPAMI.1986.4767821

C. E. Kim, Digital Disks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, issue.3, pp.372-374, 1984.
DOI : 10.1109/TPAMI.1984.4767531

C. E. Kim and T. A. Anderson, Digital disks and a digital compactness measure, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.117-124, 1984.
DOI : 10.1145/800057.808673

O. 'rourke, J. Kosaraju, S. R. Meggido, and N. , Computing circular separability, Discrete & Computational Geometry, vol.12, issue.2, pp.105-113, 1986.
DOI : 10.1007/BF02187688

A. Efrat and C. Gotsman, SUBPIXEL IMAGE REGISTRATION USING CIRCULAR FIDUCIALS, International Journal of Computational Geometry & Applications, vol.04, issue.04, pp.403-422, 1994.
DOI : 10.1142/S0218195994000227

D. Coeurjolly, Y. Gérard, J. P. Reveilì-es, and L. Tougne, An Elementary Algorithm for Digital Arc Segmentation, Discrete Applied Math, vol.139, pp.1-3, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00185112

C. Fiorio, D. Jamet, and J. L. Toutant, Discrete circles: an arithmetical approach with non-constant thickness, Vision Geometry XIV, pp.60660-60661, 2006.
DOI : 10.1117/12.642976
URL : https://hal.archives-ouvertes.fr/hal-00580556

N. Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of the ACM, vol.31, issue.1, pp.114-127, 1984.
DOI : 10.1145/2422.322418

R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete & Computational Geometry, vol.6, issue.3, pp.423-434, 1991.
DOI : 10.1007/BF02574699
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.5290

M. Worring and A. W. Smeulders, Digitized circular arcs: characterization and parameter estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.17, issue.6, pp.554-556, 1995.
DOI : 10.1109/34.387505
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.1353

M. Tajine and C. Ronse, Hausdorff Discretizations of Algebraic Sets and Diophantine Sets, Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery. DGCI '00, pp.99-110, 2000.
DOI : 10.1007/3-540-44438-6_9