On the lattice diameter of a convex polygon

DOI10.1016/S0012-365X(01)00145-5zbMATH Open0999.52011OpenAlexW2071544694MaRDI QIDQ5951925FDOQ5951925

Imre Bárány, Zoltán Füredi

Publication date: 7 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00145-5

zbMATH Keywords

latticeconvexitydiametercovering minima

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Cited In (8)

• Computational determination of the largest lattice polytope diameter
• Convex lattice polygons with all lattice points visible
• A remark on perimeter-diameter and perimeter-circumradius inequalities under lattice constraints
• The Newton polygon of a planar singular curve and its subdivision
• Lattice reduced and complete convex bodies
• Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
• An extremal result on convex lattice polygons
• On the lattice of polynomials with integer coefficients: successive minima in $L_2(0,1)$

   Recommendations

• An extremal result on convex lattice polygons 👍 👎
• Limit shape of convex lattice polygons having the minimal \(L_\infty\) diameter w. r. t. the number of their vertices 👍 👎
• Title not available (Why is that?) 👍 👎
• On the diameter of lattice polytopes 👍 👎
• Improved bounds on the diameter of lattice polytopes 👍 👎

This page was built for publication: On the lattice diameter of a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951925)