This nice article presents a solution to the following problem of Kannan and Lovász: If \(K\subset {\mathbb{R}}^ 2\) is a convex set such that each line of \({\mathbb{R}}^ 2\) meets \(K+{\mathbb{Z}}^ 2,\) does it follow that \(2K+{\mathbb{Z}}^ 2\) covers \({\mathbb{R}}^ 2?\) The author shows that in general \(\alpha K+{\mathbb{Z}}^ 2={\mathbb{R}}^ 2\) for \(\alpha \geq 1+(2/3)\sqrt{3}\approx 2.155,\) this bound is best possible and that the convex hull of (0,0), (1-\(\sqrt{3,1})\) is a worst-case example.
Recommendations
Cited in
(19)- Optimality certificates for convex minimization and Helly numbers
- Blowing up: application to G^2-continuous 8-sided filling patch
- A Minkowski-type theorem for covering minima in the plane
- A local maximizer for lattice width of 3-dimensional hollow bodies
- Blowups with log canonical singularities
- Lattice-free simplices with lattice width \(2d - o(d)\)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- On lattice-free orbit polytopes
- The (not so) trivial lifting in two dimensions
- An extremal property of lattice polygons
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width
- Homometry and direct-sum decompositions of lattice-convex sets
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- Classification of empty lattice 4-simplices of width larger than two
- Hollow polytopes of large width
- Lattice reduced and complete convex bodies
- Inequalities for the lattice width of lattice-free convex sets in the plane
- The prime grid contains arbitrarily large empty polygons
- Empty simplices of large width
This page was built for publication: Blowing up convex sets in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920403)
