Possible Duplicate:
algorithm to place maximum number of points within constrained area at a minimum spacing
I'm trying to fit as many 30ft diameter circles into polygons of certain land cover classes without any overlap, neither with one another nor with adjacent classes. I'm trying to fit the maximum number possible.
I'm having two problems, I can't figure out how to drop circles and I can't figure out how to maximize the number of them.
Any thoughts?