Covering a rectangle with six and seven circles

DOI10.1016/S0166-218X(99)00130-4zbMath0951.52017WikidataQ127474324 ScholiaQ127474324MaRDI QIDQ1962064

J. B. M. Melissen, Peter Cornelis Schuur

Publication date: 3 January 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering a rectanglesix and seven circles

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

Geometric partitioning and robust ad-hoc network design, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, Global exact optimization for covering a rectangle with 6 circles, Unnamed Item, 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, Packing, covering and tiling in two-dimensional spaces, Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles, AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS, Covering a compact polygonal set by identical circles, 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, On reserve and double covering problems for the sets with non-Euclidean metrics, Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Unsolved problems in geometry
• Covering a rectangle with equal circles
• 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