Covering a square by equal circles

MaRDI QIDQ1908133zbMATH OpenFDO

Authors Tibor Tarnai, Zsolt Gáspár

Publication date 4 March 1996

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/141584

zbMATH Keywords

covering by circlesfinite coveringminimum density

Mathematics Subject Classification ID

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

Review text

Results for the finite packing problem of \(n\) equal circles in the unit square \(S\) are well known for many numbers \(n\). Corresponding results for the dual finite covering problem seem to be unknown: What is the smallest radius \(r_n\) of \(n\) equal circles which can cover \(S\) and how must \(S\) be covered? The authors associate with a covering of \(S\) a bipartite graph which is interpreted as a network of straight bars. With an interesting physical ``cooling technique as developed by the authors [Math. Proc. Camb. Philos. Soc. 110, No. 1, 71-89 (1991; Zbl 0736.52009)] they have discovered locally optimal coverings for all \(n\leq 10\). The results for \(r_n\) and the conjectured minimum density are collected in a table without details of the calculations.

Recommendations

• Improved coverings of a square with six and eight equal circles
• Covering a rectangle with equal circles
• New results in the packing of equal circles in a square
• Packing equal circles in a square
• Covering the sphere with equal circles

Cited in

(21)

• Covering the sphere with 11 equal circles
• Covering a square by small perimeter rectangles
• Covering a rectangle with equal circles
• Improved coverings of a square with six and eight equal circles
• Covering a rectangle with six and seven circles
• Optimal covering points and curves
• Global exact optimization for covering a rectangle with 6 circles
• Short chains in circle and in square coverings
• 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
• Cutting circles into equal area pieces
• Partial covering of a circle by equal circles. II: The case of 5 circles
• On reserve and double covering problems for the sets with non-Euclidean metrics
• Robust Designs for Circle Coverings of a Square
• 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
• Optimal covering points and related problems
• On covering of cylindrical and conical surfaces with equal balls
• Minimal number of sensors for 3D coverage
• Covering a compact polygonal set by identical circles

This page was built for publication: Covering a square by equal circles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908133)