Finite packing and covering by congruent convex domains

DOI10.1007/s00454-003-0005-8zbMath1046.52014OpenAlexW2906727341MaRDI QIDQ1423580

Károly jun. Böröczky

Publication date: 7 March 2004

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

Full work available at URL: https://doi.org/10.1007/s00454-003-0005-8

zbMATH Keywords

convex domainlattice tilingcentrally symmetric convex domaincovering by non-crossing congruent domainsimitating a cell decompositionminimum circumscribed polygonpacking congruent domains

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (1)

Packing, covering and tiling in two-dimensional spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite coverings by translates of centrally symmetric convex domains
• Densest packings of typical convex sets are not lattice-like
• Covering the Plane with Convex Sets
• On minimum circumscribed polygons

This page was built for publication: Finite packing and covering by congruent convex domains