5
$\begingroup$

Let us say that I have a rectangular area that has to always look "filled" with circles. (the void spaces with the given number of circles should be minimal)(Goal)

Let us assume that, I am also told that there will be n circles that I want to fit into the container and I am also given relative sizes of different circles (i.e say that n/2 circles have to be twice the size of the remaining n/2 circles). Now the question is whether there is a way to synthesize the size of the circles such that te container looks "filled".

Improve this question
$\endgroup$
3
  • 1
    $\begingroup$ Appolonian gaskets (en.wikipedia.org/wiki/Apollonian_gasket) spring to mind... $\endgroup$
    – Johannes
    Commented Jan 20, 2015 at 13:25
  • 1
    $\begingroup$ I think this is more a general math problem for mathsSE than a puzzle, unless you specify a very distinct problem to which a nice solution exists. I have voted for closure as off-topic asking to relocate the question. This is not meant as a turn-down, though. $\endgroup$
    – BmyGuest
    Commented Jan 22, 2015 at 10:37
  • $\begingroup$ The optimal size and packing will depend on r, the aspect ratio of the rectangle. Might as well pick, for illustration here, r = 2.0 $\endgroup$
    – smci
    Commented Feb 13, 2018 at 9:42

1 Answer 1

Reset to default
7
$\begingroup$

Your question falls into the area of "circle packing" problems. Even some highly restricted special cases of circle packing are very hard and messy, and there exists no general theory for attacking them.

A good survey on the current knowledge of the area is given at http://www.packomania.com/

Improve this answer
$\endgroup$
4
  • $\begingroup$ Thanks. After going through the link, I realise it is a difficult problem. But are there any safe approximations that might be possible? $\endgroup$
    – suzee
    Commented Jan 20, 2015 at 10:19
  • $\begingroup$ Another key difference is that we are also free to choose the size of the circles (satisfying certain constrainsts, ofcourse), doesnt it make the problem simpler? $\endgroup$
    – suzee
    Commented Jan 20, 2015 at 12:22
  • $\begingroup$ Stupid but probably good approximation: $n$ small circles fall into the container. Shake the container. Simulate physics. Grow the circles until they won't grow any more. $\endgroup$
    – Lopsy
    Commented Jan 21, 2015 at 13:51
  • $\begingroup$ @Lopsy hexagonal packing is, I believe, the most dense packing. Nature does it. (Think bee hives with circles inscribed into hexagons) - ah, I misread your comment. But your solution will create the condition after the solution. (Robin Hood firing anywhere and then proclaiming that was exactly where the arrow should have gone...) $\endgroup$
    – BmyGuest
    Commented Jan 22, 2015 at 10:40

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.