A. Thom, A Statistical Examination of the Megalithic Sites in Britain, Journal of the Royal Statistical Society. Series A (General), vol.118, issue.3, pp.275-295, 1955.
DOI : 10.2307/2342494

V. Karimaki, Effective circle fitting for particle trajectories, Nuclear Instruments and Methods in Physics Research, Section A, pp.305-187, 1991.

X. Hilaire and K. Tombre, Robust and accurate vectorization of line drawings, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.6, pp.890-904, 2006.
DOI : 10.1109/TPAMI.2006.127
URL : https://hal.archives-ouvertes.fr/inria-00000394

I. Frosio and N. A. Borghese, Real-time accurate circle fitting with occlusions, Pattern Recognition, vol.41, issue.3, pp.1045-1055, 2008.
DOI : 10.1016/j.patcog.2007.08.011

V. Le and D. T. Lee, Out-of-roundness problem revisited, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.3, pp.217-223, 1991.
DOI : 10.1109/34.75510

K. Swanson, D. T. Lee, and V. L. Wu, An optimal algorithm for roundness determination on convex polygons, Computational Geometry, vol.5, issue.4, pp.225-235, 1995.
DOI : 10.1016/0925-7721(95)00004-6

J. Pegna and C. Guo, Computational metrology of the circle, Proceedings. Computer Graphics International (Cat. No.98EX149), pp.350-363, 1998.
DOI : 10.1109/CGI.1998.694285

M. De-berg, P. Bose, D. Bremner, S. Ramaswami, and G. Wilfong, Computing constrained minimum-width annuli of point sets, Computer-Aided Design, vol.30, issue.4, pp.267-275, 1998.
DOI : 10.1016/S0010-4485(97)00073-0

P. K. Agarwal, B. Aronov, S. Har-peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, pp.687-705, 2000.
DOI : 10.1145/304893.304992

M. Chen, Roundness measurements for discontinuous perimeters via machine visions, Computers in Industry, vol.47, issue.2, pp.185-197, 2002.
DOI : 10.1016/S0166-3615(01)00143-9

P. Bose and P. Morin, Testing the Quality of Manufactured Disks and Balls, Algorithmica, vol.38, issue.1, pp.161-177, 2004.
DOI : 10.1007/s00453-003-1048-z

C. M. Shakarji and A. Clement, Reference Algorithms for Chebyshev and One-Sided Data Fitting for Coordinate Metrology, CIRP Annals - Manufacturing Technology, vol.53, issue.1, pp.439-442, 2004.
DOI : 10.1016/S0007-8506(07)60734-3

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

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

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

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

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

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

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

D. Coeurjolly, Y. Gérard, J. Reveilì-es, and L. Tougne, An elementary algorithm for digital arc segmentation, Discrete Applied Mathematics, vol.139, pp.1-3, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00185112

R. M. Haralick, A Measure for Circularity of Digital Figures, IEEE Transactions on Systems, Man, and Cybernetics, vol.4, issue.4, pp.394-396, 1974.
DOI : 10.1109/TSMC.1974.5408463

U. Roy and X. Zhang, Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error, Computer-Aided Design, vol.24, issue.3, pp.161-168, 1992.
DOI : 10.1016/0010-4485(92)90035-9

S. I. Gass, C. Witzgall, and H. H. Harary, Fitting Circles and Spheres to Coordinate Measuring Machine Data, The International Journal in Flexible Manufacturing Systems, vol.10, pp.5-25, 1998.
DOI : 10.1007/978-1-4757-2878-1_7

T. J. Rivlin, Approximation durch Kreise, Computing, vol.9, issue.2, pp.93-104, 1979.
DOI : 10.1007/BF02253130

M. J. Bottema, Circularity of objects in images, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), pp.2247-2250, 2000.
DOI : 10.1109/ICASSP.2000.859286

D. Coeurjolly and R. Klette, A comparative evaluation of length estimators of digital curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.2, pp.252-257, 2004.
DOI : 10.1109/TPAMI.2004.1262194
URL : https://hal.archives-ouvertes.fr/hal-00185088

I. Debled-renesson and J. , A LINEAR ALGORITHM FOR SEGMENTATION OF DIGITAL CURVES, International Journal of Pattern Recognition and Artificial Intelligence, vol.09, issue.04, pp.635-662, 1995.
DOI : 10.1142/S0218001495000249

R. O. Duda and P. E. Hart, Use of the Hough transformation to detect lines and curves in pictures, Communications of the ACM, vol.15, issue.1, pp.11-15, 1972.
DOI : 10.1145/361237.361242

D. Luo, P. Smart, and J. E. Macleod, Circular hough transform for roundness measurement of objects, Pattern Recognition, vol.28, issue.11, pp.1745-1749, 1995.
DOI : 10.1016/0031-3203(95)00045-2

S. Pei and J. Horng, Circular arc detection based on Hough transform, Pattern Recognition Letters, vol.16, issue.6, pp.615-625, 1995.
DOI : 10.1016/0167-8655(95)80007-G

U. M. Landau, Estimation of a circular arc center and its radius, Computer Vision, Graphics, and Image Processing, vol.38, issue.3, pp.317-326, 1987.
DOI : 10.1016/0734-189X(87)90116-2

S. M. Thomas and Y. T. Chan, A simple approach for the estimation of circular arc center and its radius, Computer Vision, Graphics, and Image Processing, vol.45, issue.3, pp.362-370, 1989.
DOI : 10.1016/0734-189X(89)90088-1

M. Berman, Large sample bias in least squares estimators of a circular arc center and its radius, Computer Vision, Graphics, and Image Processing, vol.45, issue.1, pp.126-128, 1989.
DOI : 10.1016/0734-189X(89)90075-3

Z. Drezner, S. Steiner, and G. O. Wesolowsky, On the circle closest to a set of points, Computers & Operations Research, vol.29, issue.6, pp.637-650, 2002.
DOI : 10.1016/S0305-0548(99)00105-7

T. Roussillon, I. Sivignon, and L. Tougne, Test of circularity and measure of circularity for digital curves, International Conference on Image Processing, pp.518-524, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01501286

N. Megiddo, Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems, SIAM Journal on Computing, vol.12, issue.4, pp.759-776, 1984.
DOI : 10.1137/0212052

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

F. P. Preparata and M. I. Shamos, Computational geometry : an introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6

M. De-berg, M. Van-kreveld, M. Overmars, and O. Scharzkopf, Computation geometry, algorithms and applications, 2000.

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1978.
DOI : 10.1090/S0002-9904-1929-04793-1

D. Acketa and J. Zuni´czuni´c, On the maximal number of edges of convex digital polygons included into an m ?? m-grid, Journal of Combinatorial Theory, Series A, vol.69, issue.2, pp.358-368, 1995.
DOI : 10.1016/0097-3165(95)90058-6

A. A. Melkman, On-line construction of the convex hull of a simple polyline, Information Processing Letters, vol.25, issue.1, pp.11-12, 1987.
DOI : 10.1016/0020-0190(87)90086-X

O. Devillers and F. P. Preparata, Culling a Set of Points for Roundness or Cylindricity Evaluations, International Journal of Computational Geometry & Applications, vol.13, issue.03, pp.231-240, 2003.
DOI : 10.1142/S021819590300113X
URL : https://hal.archives-ouvertes.fr/inria-00412608

T. Kanungo, R. M. Haralick, H. S. Baird, W. Stuezle, and D. Madigan, A statistical, nonparametric methodology for document degradation model validation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, pp.1209-1223, 2000.

T. Hirata, A unified linear-time algorithm for computing distance maps, Information Processing Letters, vol.58, issue.3, pp.129-133, 1996.
DOI : 10.1016/0020-0190(96)00049-X

T. Roussillon, I. Sivignon, and L. Tougne, Robust decomposition of a digital curve into convex and concave parts, 2008 19th International Conference on Pattern Recognition, 2008.
DOI : 10.1109/ICPR.2008.4761597
URL : https://hal.archives-ouvertes.fr/hal-01501289