scientific article; zbMATH DE number 1156862
From MaRDI portal
Publication:4390858
The lattice diameter of a convex lattice polygon \(P\) is the maximal number of collinear points of \(P\). Let \(\alpha(n)\) denote the maximal area of all convex lattice polygon with lattice diameter \(n\). Then the author shows that for \(n \geq 6:n^2-5\leq \alpha(n)\leq n^2-3\). He uses some previous results by Zoltan Füredi, who conjectures that the lower bound is tight.
Recommendations
Cited in
(11)- Areas of lattice figures in the planar tilings with congruent regular polygons
- An extremal result on convex lattice polygons
- The area of empty axis-parallel boxes amidst 2-dimensional lattice points
- Mixed area of convex bodies
- On the area of planar convex sets containing many lattice points
- Notes on Optimal Convex Lattice Polygons
- Size and area of square lattice polygons
- scientific article; zbMATH DE number 866010 (Why is no real title available?)
- Area Bounds of Rectilinear Polygons Realized by Angle Sequences
- scientific article; zbMATH DE number 7065711 (Why is no real title available?)
- On the lattice diameter of a convex polygon
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390858)