Answers are grounded in this paper and cite their sources.
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square with up to ten equal circles. We will give improved coverings with six and eight circles and a new, thin covering with eleven circles, found by the use of simulated annealing. Furthermore, we present a combinatorial method for constructing lower bounds for the optimal covering radius.
No takes yet. Share an insight, caveat, or question.
Melissen et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: