Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square aiming to get the greatest minimal separation, dn, between points. To convert between these two formulations of the problem, the square side for unit circles will be . Solutions (not necessarily optimal) have been computed for every N≤10,000. Solutions up to N=20 are shown below:

Property Value
dbo:abstract
• Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square aiming to get the greatest minimal separation, dn, between points. To convert between these two formulations of the problem, the square side for unit circles will be . Solutions (not necessarily optimal) have been computed for every N≤10,000. Solutions up to N=20 are shown below: The obvious square packing is optimal for 1, 4, 9, 16, 25, and 36 circles (the smallest six square numbers), but ceases to be optimal for larger squares from 49 onwards. (en)
dbo:thumbnail
dbo:wikiPageID
• 27471721 (xsd:integer)
dbo:wikiPageLength
• 4411 (xsd:integer)
dbo:wikiPageRevisionID
• 983167142 (xsd:integer)