Suppose there is a square each of side $a$. I want to fill the square with circle of radius $r$. How many overlapping circles are needed to fill up the square?
Minimum number of circles to fill up a square
2
$\begingroup$
combinatorics
-
0exactly filling it up is not possible i guess, it becomes a quite tedious calculation ain't it? – 2011-12-27
-
0anyway related to this - http://stackoverflow.com/questions/7946152/ideas-for-an-algorithm-for-random-distribution-of-circles-in-a-square ? – 2011-12-27
-
0There probably is no "nice" exact formula for arbitrary a and r, but an overlapping hexagonal cover will be asymptotically optimal. – 2011-12-27
-
0Thank you very much for answers. – 2012-01-02