Dense packings of congruent circles in a circle
From MaRDI portal
Publication:1381854
DOI10.1016/S0012-365X(97)00050-2zbMath0901.52017OpenAlexW2055789678MaRDI QIDQ1381854
Kari J. Nurmela, Patric R. J. Östergård, Boris D. Lubachevsky, Ronald L. Graham
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00050-2
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40) Mathematical programming (90C99)
Related Items
Dense packing of congruent circles in free-form non-convex containers, Optimizing the packing of cylinders into a rectangular container: A nonlinear approach, Baby skyrmions in AdS, A dynamic adaptive local search algorithm for the circular packing problem, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, Quasi-physical global optimization method for solving the equal circle packing problem, Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality, The smallest convex \(k\)-gon containing \(n\) congruent disks, Packing disks into disks with optimal worst-case density, ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX, Packing, covering and tiling in two-dimensional spaces, An algorithm for maximising covered area, Solving circle packing problems by global optimization: numerical results and industrial applications, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles, AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS, Adaptive and restarting techniques-based algorithms for circular packing problems, Global optimization method for finding dense packings of equal circles in a circle, Disk packing for the estimation of the size of a wire bundle, New heuristics for packing unequal circles into a circular container, Reformulation descent applied to circle packing problems, Unnamed Item, Producing dense packings of cubes, Optimal packings for filled rings of circles., Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition), The plane-width of graphs, Repulsion-based p-dispersion with distance constraints in non-convex polygons, Delaunay triangulation of imprecise points in linear time after preprocessing, Iterated dynamic thresholding search for packing equal circles into a circular container
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- How to simulate billiards and similar systems
- Unsolved problems in geometry
- Penny-packing and two-dimensional codes
- Densest packings of eleven congruent circles in a circle
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Packing up to 50 equal circles in a square
- Curved hexagonal packings of equal disks in a circle
- Packing 16, 17 or 18 circles in an equilateral triangle
- The closest packing of equal circles on a sphere
- Dense Packing of Equal Circles within a Circle
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
- Packing Cylinders into Cylindrical Containers
- Packing of 14, 16, 17 and 20 Circles in a Circle
