Finite coverings by translates of centrally symmetric convex domains
From MaRDI portal
DOI10.1007/BF02187889zbMATH Open0632.52011OpenAlexW2110431853MaRDI QIDQ1095409FDOQ1095409
Authors: B. George
Publication date: 1987
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131028
Recommendations
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)
Cites Work
- The closest packing of convex two-dimensional domains
- Title not available (Why is that?)
- On minimum circumscribed polygons
- Title not available (Why is that?)
- Covering the Plane with Convex Sets
- Über dichteste Kreislagerung und dünnste Kreisüberdeckung
- On coverings with convex domains
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
Cited In (7)
- Title not available (Why is that?)
- Covering the plane with two kinds of circles
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
- Packing, covering and tiling in two-dimensional spaces
- Some Remarks on Translative Coverings of Convex Domains by Strips
- Inextensible domains
- Finite packing and covering by congruent convex domains
This page was built for publication: Finite coverings by translates of centrally symmetric convex domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095409)