More optimal packings of equal circles in a square
From MaRDI portal
Publication:1807617
DOI10.1007/PL00009472zbMath0931.05019OpenAlexW2018506582MaRDI QIDQ1807617
Kari J. Nurmela, Patric R. J. Östergård
Publication date: 16 February 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009472
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)
Related Items (27)
Packing equal circles in a square: A deterministic global optimization approach ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Interval methods for verifying structural optimality of circle packing configurations in the unit square ⋮ Review of obnoxious facilities location problems ⋮ Greedy vacancy search algorithm for packing equal circles in a square ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus ⋮ The repeated p-dispersion problem ⋮ Uniformly inserting points on square grid ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ A nonsmooth program for jamming hard spheres ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ Online Inserting Points Uniformly on the Sphere ⋮ Efficiently packing unequal disks in a circle ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ A reliable area reduction technique for solving circle packing problems ⋮ One-dimensional nested maximin designs ⋮ On the higher eigenvalues for the \(\infty\)-eigenvalue problem ⋮ Online uniformly inserting points on the sphere ⋮ A model to design recreational boat mooring fields ⋮ Improved interval methods for solving circle packing problems in the unit square ⋮ Minimum perimeter rectangles that enclose congruent non-overlapping circles ⋮ On the packing of fourteen congruent spheres in a cube ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure
This page was built for publication: More optimal packings of equal circles in a square