Pages that link to "Item:Q1381854"

The following pages link to Dense packings of congruent circles in a circle (Q1381854):

Displaying 26 items.

• Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
• Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
• Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
• Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
• Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
• Disk packing for the estimation of the size of a wire bundle (Q1764345) (← links)
• Reformulation descent applied to circle packing problems (Q1772872) (← links)
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
• Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• Optimal packings for filled rings of circles. (Q2304216) (← links)
• Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
• Producing dense packings of cubes (Q2519836) (← links)
• Baby skyrmions in AdS (Q2635775) (← links)
• A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
• The smallest convex \(k\)-gon containing \(n\) congruent disks (Q2674985) (← links)
• Packing disks into disks with optimal worst-case density (Q2679596) (← links)
• Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles (Q2743873) (← links)
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality (Q2940517) (← links)
• The plane-width of graphs (Q3096959) (← links)
• (Q5088965) (← links)
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)