K. Pankaj, B. Agarwal, and . Aronov, Sariel Har-Peled, and Micha Sharir Approximation and exact algorithms for minimum-width annuli and shells, Proc. 15th Annu. ACM Sympos, pp.380-389, 1999.

K. Pankaj, B. Agarwal, M. Aronov, and . Sharir, Line traversals of balls and smallest enclosing cylinders in three dimensions, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pp.483-492, 1997.

K. Pankaj, M. Agarwal, and . Sharir, Efficient randomized algorithms for some geometric optimization problems, Discrete Comput. Geom, vol.16, pp.317-337, 1996.

J. García-lópez, P. Ramos, and J. Snoeyink, Fitting a Set of Points by a Circle, Discrete & Computational Geometry, vol.20, issue.3, pp.389-402, 1998.
DOI : 10.1007/PL00009392

P. A. Ramos, Computing roundness is easy if the set is almost round, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, pp.307-315, 1999.
DOI : 10.1145/304893.304984
URL : https://hal.archives-ouvertes.fr/hal-00795064

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

M. Sharir and E. Welzl, A combinatorial bound for linear programming and related problems, Proc. 9th Sympos, pp.569-579, 1992.
DOI : 10.1007/3-540-55210-3_213