Isn't this a variation of a sphere-packing problem? We know an optimally dense packing for 2D spheres. Then vary the radius of what is being packed until N of them fit in the disk's area.
We do? I think this is the latest state of the research here — only 14 Ns are proven optimal and it's certainly nowhere close to a general algorithm: http://hydra.nat.uni-magdeburg.de/packing/cci/
There's something to be said for a dozen lines of numpy that gets "close enough". That said, I do think there should be something better.