Efficient covering of thin convex domains using congruent discs

Shai Gul, Reuven Cohen

Research output: Contribution to journalArticlepeer-review


We present efficient strategies for covering classes of thin domains in the plane using unit discs. We start with efficient covering of narrow domains using a single row of covering discs. We then move to efficient covering of general rectangles by discs centered at the lattice points of an irregular hexagonal lattice. This optimization uses a lattice that leads to a covering using a small number of discs. We compare the bounds on the covering using the presented strategies to the bounds obtained from the standard honeycomb covering, which is asymptotically optimal for fat domains, and show the improvement for thin domains.

Original languageEnglish
Article number3056
Issue number23
StatePublished - 1 Dec 2021


  • Covering
  • Optimal placement
  • Thin domains

All Science Journal Classification (ASJC) codes

  • Mathematics(all)


Dive into the research topics of 'Efficient covering of thin convex domains using congruent discs'. Together they form a unique fingerprint.

Cite this