Gritzmann, Peter; Wills, Jörg M. Lattice points. (English) Zbl 0798.52014 Gruber, P. M. (ed.) et al., Handbook of convex geometry. Volume B. Amsterdam: North-Holland. 765-797 (1993). This article surveys various lattice point problems connected with convexity. Most of them concern convex lattice polytopes and the lattice point enumerator. Here are the main subjects discussed in the paper: Minkowski’s functional theorem and theorem on successive minima, bounds for lattice point enumerator in terms of intrinsic volumes, lattice polyhedra in combinatorial optimization, computational complexity of lattice point problems. Moreover, the authors provide a survey of equalities and inequalities concerning the diameter, the circumradius, the inradius and the minimum width of lattice-point-free convex bodies.For the entire collection see [Zbl 0777.52002]. Reviewer: M.Lassak (Bydgoszcz) Cited in 28 Documents MSC: 52C07 Lattices and convex bodies in \(n\) dimensions (aspects of discrete geometry) 52C05 Lattices and convex bodies in \(2\) dimensions (aspects of discrete geometry) 68R99 Discrete mathematics in relation to computer science Keywords:lattice point problems; convexity; convex lattice polytopes; lattice point enumerator; survey; convex bodies PDFBibTeX XMLCite \textit{P. Gritzmann} and \textit{J. M. Wills}, in: Handbook of convex geometry. Volume B. Amsterdam: North-Holland. 765--797 (1993; Zbl 0798.52014) Online Encyclopedia of Integer Sequences: Number of (w,x,y,z) with all terms in {1,...,n} and w*x < 2*y*z. Number of (w,x,y) such that w,x,y are all in {0,...,n} and |w-x| = |x-y|.