]. A. Abo-+-89, H. Aggarwal, J. Booth, S. O-'rourke, C. K. Suri et al., Finding minimal convex nested polygons, Inform. Comput, vol.83, issue.1, pp.98-110, 1989.

L. [. Aggarwal, J. Guibas, P. W. Saxe, and . Shor, A linear-time algorithm for computing the voronoi diagram of a convex polygon, Discrete & Computational Geometry, vol.9, issue.6, pp.591-604, 1989.
DOI : 10.1007/BF02187749

J. Jean-daniel-boissonnat, O. Czyzowicz, J. Devillers, M. Robert, and . Yvinec, Convex tours of bounded curvature, Proc. 2nd Annu. European Sympos. Algorithms, pp.254-265, 1994.
DOI : 10.1007/BFb0049413

M. [. Brönnimann and . Goodrich, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom, vol.14, pp.263-279, 1995.

]. B. Bha88 and . Bhattacharya, Circular separability of planar point sets, Computational Morphology, pp.25-39, 1988.

D. [. Das and . Joseph, The complexity of minimum convex nested polyhedra, Proc. 2nd Canad. Conf, pp.296-301, 1990.

D. [. Dobkin and . Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, Journal of Algorithms, vol.6, issue.3, pp.381-392, 1985.
DOI : 10.1016/0196-6774(85)90007-0

F. [. Edelsbrunner and . Preparata, Minimum polygonal separation, Information and Computation, vol.77, issue.3, pp.218-232, 1988.
DOI : 10.1016/0890-5401(88)90049-1

]. S. Fis86 and . Fisk, Separating points by circles and the recognition of digital discs, IEEE Trans. Pattern Anal. Mach. Intell, vol.8, issue.4, pp.554-556, 1986.

T. [. Kim and . Anderson, Digital Disks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, issue.3, pp.639-645, 1984.
DOI : 10.1109/TPAMI.1984.4767531

]. D. Kir83 and . Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput, vol.12, issue.1, pp.28-35, 1983.

]. S. Lay71 and . Lay, On separation by spherical surfaces, Amer. Math. Monthly, vol.78, pp.1112-1113, 1971.

D. T. Lee, On finding the convex hull of a simple polygon, International Journal of Computer & Information Sciences, vol.1, issue.2, pp.87-98, 1983.
DOI : 10.1007/BF00993195

]. N. Meg84 and . Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM, vol.31, pp.114-127, 1984.

]. D. Mou92 and . Mount, Intersection detection and separators for simple polygons, Proc. 8th Annu. ACM Sympos, pp.303-311, 1992.

S. B. Joseph, S. Mitchell, and . Suri, Separation and approximation of polyhedral objects, Comput. Geom. Theory Appl, vol.5, pp.95-114, 1995.

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