, DGtal: Digital geometry tools and algorithms library

A. Aggarwal, H. Booth, J. O'rourke, S. Suri, and C. Yap, Finding minimal convex nested polygons, Information and Computation, vol.83, issue.1, pp.98-110, 1989.

A. I. Barvinok, Lattice points and lattice polytopes, Handbook of Discrete and Computational Geometry, pp.153-176, 2004.

M. Beck and S. Robins, Computing the Continuous Discretely, Undergraduate Texts in Mathematics, 2007.

H. F. Blichfeldt, A new principle in the geometry of numbers, with some applications, Transactions of the American Mathematical Society, vol.15, pp.227-235, 1914.

G. Das and D. Joseph, The complexity of minimum convex nested polyhedra, Proceedings of the 2nd Canadian Conference of Computational Geometry, pp.296-301, 1990.

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

E. Ehrhart, Sur les polyèdres rationnels homothétiqueshomothétiques`homothétiquesà n dimensions, Comptes Rendus de l'Académie des Sciences, vol.254, pp.616-618, 1962.

C. Haase and G. Ziegler, On the maximal width of empty lattice simplices, European Journal of Combinatorics, vol.21, pp.111-119, 2000.

H. Lenstra, Integer programming with a fixed number of variables, Mathematics of Operations Research, vol.8, pp.538-548, 1983.

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.

H. E. Scarf, Integral polyhedra in three space, Mathematics of Operations Research, vol.10, pp.403-438, 1985.

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