Covering the Square Lattice and the Honeycomb with Non-Overlapping Unit Disks

For $d>0$, let $\mathcal{S}_d$ be the square lattice and $\mathcal{H}_d$ the honeycomb point set with minimum distance $d$. We study for which $d$ these sets can be covered by closed unit disks with pairwise disjoint interiors; the periodic constructions of Phetmak, Nuntasombat and Fakcharoenphol cover them only from $d=1/2$ and $d=2/\sqrt{37}$ on, with gaps. Writing $\mathcal{N}(d)$ for the largest number of points in a closed unit disk and $ρ$ for the number of points per unit area, we show that neither set can be covered when $\mathcal{N}(d)<2\sqrt3\,ρ$, and we determine these spacings exactly, thirteen intervals for $\mathcal{S}_d$ and twelve for $\mathcal{H}_d$. At their right endpoints the bound is attained; there $\mathcal{S}_d$ is never coverable, and $\mathcal{H}_d$ is not coverable at nine of the twelve endpoints. We also give new periodic coverings, of $\mathcal{S}_d$ at $d=2/\sqrt{34}$ and of $\mathcal{H}_d$ for $2/9\le d\le1/\sqrt{19}$. Consequently, the smallest coverable spacing lies in $(0.2581,\,2/\sqrt{34}]$ for the square lattice and in $(0.1781,\,2/9]$ for the honeycomb point set, and coverability is not monotone in $d$ for either set.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16894
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Covering the Square Lattice and the Honeycomb with Non-Overlapping Unit Disks

Kirati Sriamorn, Nattawut Phetmak, Teeradej Kittipassorn
arXiv (Cornell University)
Computational Geometry and Mesh Generation
preprint

Covering the Square Lattice and the Honeycomb with Non-Overlapping Unit Disks

Kirati Sriamorn, Nattawut Phetmak, Teeradej Kittipassorn
preprint en

Abstract

For $d>0$, let $\mathcal{S}_d$ be the square lattice and $\mathcal{H}_d$ the honeycomb point set with minimum distance $d$. We study for which $d$ these sets can be covered by closed unit disks with pairwise disjoint interiors; the periodic constructions of Phetmak, Nuntasombat and Fakcharoenphol cover them only from $d=1/2$ and $d=2/\sqrt{37}$ on, with gaps. Writing $\mathcal{N}(d)$ for the largest number of points in a closed unit disk and $ρ$ for the number of points per unit area, we show that neither set can be covered when $\mathcal{N}(d)<2\sqrt3\,ρ$, and we determine these spacings exactly, thirteen intervals for $\mathcal{S}_d$ and twelve for $\mathcal{H}_d$. At their right endpoints the bound is attained; there $\mathcal{S}_d$ is never coverable, and $\mathcal{H}_d$ is not coverable at nine of the twelve endpoints. We also give new periodic coverings, of $\mathcal{S}_d$ at $d=2/\sqrt{34}$ and of $\mathcal{H}_d$ for $2/9\le d\le1/\sqrt{19}$. Consequently, the smallest coverable spacing lies in $(0.2581,\,2/\sqrt{34}]$ for the square lattice and in $(0.1781,\,2/9]$ for the honeycomb point set, and coverability is not monotone in $d$ for either set.

arXiv (Cornell University)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon