Does anybody know an easy algorithm for the Circle Packing Problem? With Circle Packing Problem I mean that a number of n Circles with different radius are given and so the optimal packing of these circles in a given rectangle has to be found. Perhaps anyone knows such an algorithm or ressources were i can get such one. Thanks Peter Gmeiner

http://mathworld.wolfram.com/CirclePacking.html

Thanks for the link!

But the Ressources on the link does not solve the real problem. It only contains solutions for always circles with an equal radius. Does anybody knows a solution with circles that have different radius (e.g. Circle1:radius=2; Circle2:radius=5;...)?

Thanks in advance

Peter Gmeiner

This problem sounds like a good candidate for a genetic algorithm, try this link.

http://geneticalgorithms.ai-depot.com/

Or try a monte carlo algorythm, put all circles in a big box, then do this:


Look up some monte carlo site for specifics, but the algorythm above should work apart from some minor bugs i made in typing it out

[edited by - Kroxigor on March 22, 2002 11:17:47 AM]