Covering a rectangle with six and seven circles
From MaRDI portal
DOI10.1016/S0166-218X(99)00130-4zbMATH Open0951.52017WikidataQ127474324 ScholiaQ127474324MaRDI QIDQ1962064FDOQ1962064
J. B. M. Melissen, Peter Cornelis Schuur
Publication date: 3 January 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- 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
Cites Work
- Optimization by Simulated Annealing
- Title not available (Why is that?)
- Unsolved problems in geometry
- Covering a rectangle with equal circles
- Title not available (Why is that?)
- Improved coverings of a square with six and eight equal circles
- Covering a square by equal circles
- On the Least Number of Unit Circles Which Can Cover a Square
Cited In (16)
- On reserve and double covering problems for the sets with non-Euclidean metrics
- Geometric partitioning and robust ad-hoc network design
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
- Global exact optimization for covering a rectangle with 6 circles
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
- Worst-case optimal covering of rectangles by disks
- Covering a compact polygonal set by identical circles
- Packing, covering and tiling in two-dimensional spaces
- Covering a rectangle with equal circles
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- Algorithms for constructing optimal \(n\)-networks in metric spaces
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio
- Title not available (Why is that?)
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal 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)