R. Klette and A. Rosenfeld, Digital geometry: Geometric methods for digital picture analysis, 2004.

C. Ronse, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, pp.181-190, 1961.

H. Minkowski, Geometrie der Zahlen. B.G. Teubner, vol.2, 1910.

E. Chul, A. Kim, and . Rosenfeld, Digital straight lines and convexity of digital regions, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.4, issue.2, pp.149-153, 1982.

E. Chul, A. Kim, and . Rosenfeld, Convex digital solids, IEEE Trans. Pattern Anal. Mach. Intell, vol.4, issue.6, pp.612-618, 1982.

J. Chassery, Discrete convexity: Definition, parametrization, and compatibility with continuous convexity. Computer Vision, Graphics, and Image Processing, vol.21, pp.326-344, 1983.

K. Kishimoto, Characterizing digital convexity and straightness in terms of length and total absolute curvature. Computer Vision and Image Understanding, vol.63, pp.326-333, 1996.

A. Bidyut-baran-chaudhuri and . Rosenfeld, On the computation of the digital convex hull and circular hull of a digital region, Pattern Recognition, vol.31, issue.12, pp.2007-2016, 1998.

E. Barcucci, A. D. Lungo, M. Nivat, and R. Pinzani, Reconstructing convex polyominoes from horizontal and vertical projections, Theoretical Computer Science, vol.155, issue.2, pp.321-347, 1996.

A. Daurat, Salient points of q-convex sets, International Journal of Pattern Recognition and Artificial Intelligence, vol.15, issue.7, pp.1023-1030, 2001.

I. Debled-rennesson, J. Rémy, and J. Rouyer-degli, Detection of the discrete convexity of polyominoes, 9th International Conference on Discrete Geometry for Computer Im agery, vol.125, pp.115-133, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099507

X. Brlek and J. Lachaud, 14th IAPR International Conference on Discrete Geometry for Computer Imagery, vol.42, pp.2239-2246, 2008.

O. Mark-de-berg, M. Cheong, M. Van-kreveld, and . Overmars, Computational Geometry: Algorithms and Applications, 2008.

A. Yao, A lower bound to finding convex hulls, J. ACM, vol.28, issue.4, pp.780-787, 1981.

F. P. Preparata and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, vol.20, issue.2, pp.87-93, 1977.

D. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm?, SIAM Journal on Computing, vol.15, issue.1, pp.287-299, 1986.

T. M. Chan, Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete & Computational Geometry, vol.16, issue.4, pp.361-368, 1996.

B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete & Computational Geometry, vol.10, issue.4, pp.377-409, 1993.

G. Pick, Geometrisches zur zahlenlehre, Sitzungsberichte des Deutschen Naturwissenschaftlich-Medicinischen Vereines für Böhmen "Lotos" in Prag, pp.47-48, 1899.

E. Ehrhart, Sur les polyèdres rationnels homothétiqueshomothétiquesà n dimensions, 1962.

A. I. Barvinok, A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, Mathematics of Operations Research, vol.19, issue.4, pp.769-779, 1994.

A. I. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Discrete & Computational Geometry, vol.12, issue.1, pp.35-48, 1994.

C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software, vol.22, pp.469-483, 1996.

J. S. Greenfield, A proof for a quickhull algorithm, Syracuse University, 1990.

K. Arjen, H. W. Lenstra, L. Lenstra, and . Lovasz, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, issue.4, pp.515-534, 1982.

G. E. Andrews, A lower bound for the volumes of strictly convex bodies with many boundary points, Transactions of the American Mathematical Society, vol.106, pp.270-279, 1963.

I. Bárány, Extremal problems for convex lattice polytopes: A survey, Contemporary Mathematics, vol.453, pp.87-103, 2008.