#circle_packing_in_a_square
Circle packing in a square
Two-dimensional packing problem
Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is 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 L = 2 + 2/dn.
Wed 19th
Provided by Wikipedia
This keyword could refer to multiple things. Here are some suggestions:
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.