Finite coverings by translates of centrally symmetric convex domains
From MaRDI portal
Publication:1095409
DOI10.1007/BF02187889zbMath0632.52011OpenAlexW2110431853MaRDI QIDQ1095409
Publication date: 1987
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131028
Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items (3)
Covering the plane with two kinds of circles ⋮ Finite packing and covering by congruent convex domains ⋮ Packing, covering and tiling in two-dimensional spaces
Cites Work
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
- Über dichteste Kreislagerung und dünnste Kreisüberdeckung
- The closest packing of convex two-dimensional domains
- On coverings with convex domains
- Covering the Plane with Convex Sets
- On minimum circumscribed polygons
- Unnamed Item
- Unnamed Item
This page was built for publication: Finite coverings by translates of centrally symmetric convex domains
