Covering a rectangle with six and seven circles

DOI10.1016/S0166-218X(99)00130-4MaRDI QIDQ1962064zbMATH OpenWikidataFDO

Authors J. B. M. Melissen, Peter Cornelis Schuur

Publication date 3 January 2001

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

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00130-4

zbMATH Keywords

covering a rectanglesix and seven circles

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• Covering a rectangle with equal circles
• Covering a square by equal circles
• 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

Cited in

(19)

• Minimal number of sensors for 3D coverage
• On the number and arrangement of sensors for the multiple covering of bounded plane domains
• Geometric partitioning and robust ad-hoc network design
• 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
• On covering the square flat torus by congruent discs
• Global exact optimization for covering a rectangle with 6 circles
• Covering a compact polygonal set by identical circles
• Packing, covering and tiling in two-dimensional spaces
• Worst-case optimal covering of rectangles by disks
• Covering a rectangle with equal circles
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
• Uniformity of point samples in metric spaces using gap ratio
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
• Covering rectangles by disks: the video (media exposition)
• An approximation algorithm for locating maximal disks within convex polygons
• Worst-case optimal covering of triangles by disks
• 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)