Packing problems: Difference between revisions

Content deleted Content added
GreenC bot (talk | contribs)
Rescued 1 archive link. Wayback Medic 2.5
Line 84:
 
* [[Square packing in a square|Packing squares in a '''square''']]: Optimal solutions have been proven for ''n''&nbsp;=&nbsp;1–10, 14–16, 22–25, 33–36, 62–64, 79–81, 98–100, and any square integer. The wasted space is asymptotically [[Big O notation|O]](''a''<sup>7/11</sup>).
* [[Square packing in a squarecircle|Packing squares in a '''circle''']]: Good solutions are known for ''n'' up to 35.[[Image:10 kvadratoj en kvadrato.svg|thumb|120px|right|The optimal packing of 10 squares in a square]]
 
===[[Rectangle packing|Packing of rectangles]]===