Place n points in a box as far away from each other as possible Can you suggest an optimal or heuristic algorithm for placing points on a 2D plane (within a constrained space) such that minimum distance between any two points is maximized.

In other words, I'm looking to put points down in a box as far away from each other as possible.
This seems to be equivalent to packing disks of max radius -- a very well studied problem, at least if your box is a square, see, e.g.,Circle packing in a square. For heuristics see, e.g., http://www.pack-any-shape.com/