how to fill polygone with circles without intersect with each other
8 views (last 30 days)
Jan on 10 Dec 2013
I would assume, that your problem is not the actual coding, but the algorithm to use for solving this non-trivial task. Especially as you do not have (or at least did not state) any additional boundary conditions for acceptable solutions. E.g. are you looking for the minimum number of circles that cover the maximum area inside the polygon? In any case, I would start by looking into algorithms at least roughly concerned with the matter. E.g. how to construct the maximum inscribed circle in a convex polygon (this is much harder than it looks at a first glance). Maybe you can gather ideas from there, that help you solve your problem. E.g. by splitting the (non-convex) polygon into a number of convex polygons and applying the solution obtained above.