A lattice (d, k)-polytope is the convex hull of a set of points in \(\mathbb {R}^d\) whose coordinates are integers ranging between 0 and k. We consider the smallest possible distance \(\varepsilon (d,k)\) between two disjoint lattice (d, k)-polytopes. We propose an algebraic model for this distance and derive from it an explicit formula for \(\varepsilon (2,k)\) . Our model also allows for the computation of previously intractable values of \(\varepsilon (d,k)\) . In particular, we compute \(\varepsilon (3,k)\) when \(4\le {k}\le 8\) , \(\varepsilon (4,k)\) when \(2\le {k}\le 3\) , and \(\varepsilon (6,1)\) .