Covering a rectangle with equal circles

DOI10.1023/A:1004224507766zbMath0880.52008OpenAlexW1812401218MaRDI QIDQ1375068

Aladár Heppes, Hans Melissen

Publication date: 5 January 1998

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004224507766

zbMATH Keywords

thinnest covering with disks

Mathematics Subject Classification ID

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

Related Items (33)

Packing equal circles in a square: A deterministic global optimization approach ⋮ Global optimization reduction of generalized Malfatti's problem ⋮ Symplectic Packings in Cotangent Bundles of Tori ⋮ Optimal covering points and curves ⋮ Global exact optimization for covering a rectangle with 6 circles ⋮ Optimal circle covering problems and their applications ⋮ Unnamed Item ⋮ A Shape-Newton Approach to the Problem of Covering with Identical Balls ⋮ Covering the 5-dimensional unit cube by eight congruent balls ⋮ A note on diameters of point sets ⋮ Algorithms for constructing optimal \(n\)-networks in metric spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus ⋮ Optimal packings of up to six equal circles on a triangular flat torus ⋮ Covering a rectangle with six and seven circles ⋮ Covering the \(k\)-skeleton of the 3-dimensional unit cube by five balls ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Robust Designs for Circle Coverings of a Square ⋮ Nonlinear optimization with GAMS /LGO ⋮ Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles ⋮ Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study ⋮ AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS ⋮ Design of computer experiments: space filling and beyond ⋮ Covering a compact polygonal set by identical circles ⋮ Producing dense packings of cubes ⋮ Covering the \(k\)-skeleton of the 3-dimensional unit cube by six balls ⋮ 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 ⋮ A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls ⋮ Unnamed Item

This page was built for publication: Covering a rectangle with equal circles