Packing up to 50 equal circles in a square
From MaRDI portal
Publication:1361817
DOI10.1007/PL00009306zbMATH Open0880.90116MaRDI QIDQ1361817FDOQ1361817
Authors: Kari J. Nurmela, Patric R. J. Östergård 
Publication date: 28 July 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
- Packing equal circles in a square
- A better packing of ten equal circles in a square
- Packing equal squares into a large square
- Packing Squares in a Square
- Some progress in the packing of equal circles in a square
- More optimal packings of equal circles in a square
- Packing equal circles into a circle with circular prohibited areas
- Packing Circles in the Plane
- scientific article; zbMATH DE number 1342021
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cited In (40)
- One-dimensional nested maximin designs
- A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- Packing equal circles in a square
- A nonsmooth program for jamming hard spheres
- Disc covering problem with application to digital halftoning
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Efficient algorithms for the dense packing of congruent circles inside a square
- Maximin distance for \(n\) points in a unit square or a unit circle
- Global optimization method for finding dense packings of equal circles in a circle
- On the higher eigenvalues for the \(\infty\)-eigenvalue problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere
- A literature review on circle and sphere packing problems: models and methodologies
- Packing, covering and tiling in two-dimensional spaces
- On the packing of fourteen congruent spheres in a cube
- Greedy vacancy search algorithm for packing equal circles in a square
- Disk packing for the estimation of the size of a wire bundle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- (Re)packing equal disks into rectangle
- Efficiently packing unequal disks in a circle
- Solving the problem of packing equal and unequal circles in a circular container
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- Densest packings of equal circles in a square
- Spreading points using gradient and tabu
- Title not available (Why is that?)
- Optimal covering points and curves
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
- Packing equal circles in a square: A deterministic global optimization approach
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio
- Dense packings of congruent circles in a circle
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- Minimizing the object dimensions in circle and sphere packing problems
- A heuristic approach for packing identical rectangles in convex regions
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
This page was built for publication: Packing up to 50 equal circles in a square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361817)
