The covering radius and a discrete surface area for non-hollow simplices

DOI10.1007/s00454-021-00330-3zbMath1480.52010arXiv1903.02866OpenAlexW3212349535MaRDI QIDQ2066303

Giulia Codenotti, Francisco Santos, Matthias Schymura

Publication date: 14 January 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.02866

zbMATH Keywords

covering radiuslattice polytopesdiscrete surface area

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies (number-theoretic aspects) (11H06) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items

Lattice zonotopes of degree 2, Computing the covering radius of a polytope with an application to lonely runners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-spanning lattice 3-polytopes
• Moving out the edges of a lattice polygon
• On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• Lifting properties of maximal lattice-free polyhedra
• Covering minima and lattice-point-free convex bodies
• Lattice translates of a polytope and the Frobenius problem
• A Minkowski-type theorem for covering minima in the plane
• Distances between optimal solutions of mixed-integer programs
• Notes on the roots of Ehrhart polynomials
• On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
• Diameters of random circulant graphs
• Volumen und Oberfläche eines Eikörpers, der keine Gitterpunkte überdeckt
• Integer Programming with a Fixed Number of Variables
• Canonical Toric Fano Threefolds
• Minimal Determinants and Lattice Inequalities
• Combinatorial Reciprocity Theorems
• Classification of empty lattice 4-simplices of width larger than two
• Convex and Discrete Geometry