Pages that link to "Item:Q1361817"
From MaRDI portal
The following pages link to Packing up to 50 equal circles in a square (Q1361817):
Displaying 33 items.
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- Interval methods for verifying structural optimality of circle packing configurations in the unit square (Q861900) (← links)
- Efficiently packing unequal disks in a circle (Q924882) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- Disc covering problem with application to digital halftoning (Q970100) (← links)
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere (Q1017591) (← links)
- Minimum perimeter rectangles that enclose congruent non-overlapping circles (Q1025447) (← links)
- On the packing of fourteen congruent spheres in a cube (Q1027757) (← links)
- Dense packings of congruent circles in a circle (Q1381854) (← links)
- Packing equal circles in a square: A deterministic global optimization approach (Q1613419) (← links)
- Disk packing for the estimation of the size of a wire bundle (Q1764345) (← links)
- On the higher eigenvalues for the \(\infty\)-eigenvalue problem (Q1776812) (← links)
- An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
- Optimal covering points and curves (Q2126961) (← links)
- One-dimensional nested maximin designs (Q2269596) (← links)
- A nonsmooth program for jamming hard spheres (Q2439485) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles (Q2743873) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
- A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE (Q5311634) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- Spreading points using gradient and tabu (Q6097431) (← links)
- Efficient algorithms for the dense packing of congruent circles inside a square (Q6156095) (← links)
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)
- (Re)packing equal disks into rectangle (Q6642301) (← links)
