Covering a rectangle with six and seven circles
Finitely many circles (circular discs) cover a rectangle if every point of the rectangle is in one (or more) of the circles. A covering of a \(1\times b\) rectangle by \(n\) circles is thinnest if the (common) radius is smallest (among all coverings by \(n\) circles). \textit{A. Heppes} and \textit{H. Melissen} [Period. Math. Hung. 34, No. 1-2, 65-81 (1997; Zbl 0880.52008)] determined the thinnest covering by up to 5 circles (for all \(b\geq 1)\) and by 7 circles for some \(b\), namely \(1\leq b\leq 1.34457\dots\) and \(b>3.43017.\dots\) In the paper under review the authors present coverings by 7 circles for the gap (i.e., \(1.34457\dots < b<3.43017\dots)\) which they conjecture to be thinnest, and they determine thinnest coverings by 6 circlcs for \(b\geq 3.11803.\dots\).
- Covering a rectangle with equal circles
- Global exact optimization for covering a rectangle with 6 circles
- Über einige dünnste Kreisüberdeckungen konvexer Bereiche durch endliche Anzahl von kongruenten Kreisen
- Thinnest covering of a circle by eight, nine, or ten congruent circles
- scientific article; zbMATH DE number 598150
- Covering a rectangle with equal circles
- Covering a square by equal circles
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- Improved coverings of a square with six and eight equal circles
- On the Least Number of Unit Circles Which Can Cover a Square
- Optimization by simulated annealing
- Unsolved problems in geometry
- Covering a rectangle with equal circles
- Algorithms for constructing optimal \(n\)-networks in metric spaces
- Global exact optimization for covering a rectangle with 6 circles
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
- Geometric partitioning and robust ad-hoc network design
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- On reserve and double covering problems for the sets with non-Euclidean metrics
- An approximation algorithm for locating maximal disks within convex polygons
- Packing, covering and tiling in two-dimensional spaces
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- On covering the square flat torus by congruent discs
- Uniformity of point samples in metric spaces using gap ratio
- Covering rectangles by disks: the video (media exposition)
- Worst-case optimal covering of rectangles by disks
- Worst-case optimal covering of triangles by disks
- Minimal number of sensors for 3D coverage
- Covering a compact polygonal set by identical circles
This page was built for publication: Covering a rectangle with six and seven circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962064)
