T. Asano, V. E. Brimkov, and R. P. Barneva, Some theoretical challenges in digital geometry: A perspective, Discrete Appl. Math, vol.157, issue.16, pp.3362-3371, 2009.

M. Blanco, C. Haase, J. Hofmann, and F. Santos, The finiteness threshold width of lattice polytopes, 2016.

H. Edelsbrunner and F. Preparata, Minimum polygonal separation, Information and Computation, vol.77, issue.3, pp.218-232, 1988.

S. Forchhammer and C. Kim, Digital squares, vol.2, pp.672-674, 1988.

Y. Gerard, About the decidability of polyhedral separability in the lattice z d, Journal of Mathematical Imaging and Vision, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02023867

Y. Gérard, Recognition of digital polyhedra with a fixed number of faces, Discrete Geometry for Computer Imagery-19th IAPR International Conference, DGCI 2016, pp.415-426, 2016.

R. Krishnaswamy and C. E. Kim, Digital parallelism, perpendicularity, and rectangles, IEEE Trans. Pattern Anal. Mach. Intell, vol.9, issue.2, pp.316-321, 1987.

N. Megiddo, Linear-time algorithms for linear programming in r 3 and related problems, SIAM J. Comput, vol.12, issue.4, pp.759-776, 1983.

N. Megiddo, On the complexity of polyhedral separability, Discrete and Computational Geometry, vol.3, issue.4, pp.325-337, 1988.

A. Nakamura and K. Aizawa, Digital squares. Computer Vision, Graphics, and Image Processing, vol.49, pp.357-368, 1990.

A. Schrijver, Theory of Linear and Integer Programming, 1986.

G. Ziegler, Lectures on Polytopes. Graduate Texts in Mathematics, 1995.