I want to generate random points in a square, such that any two points must be a certain minimum distance from each other. I know that one way to do this would be to simply generate uniformly distributed points in the square, one by one, and make sure each new point is at least the minimum distance from the previously generated point and throw away any points that are closer to a previously generated point than the minimum distance. This method can be inefficient for generating points if there are a lot of points, or if the ratio between the minimum distance and the average distance between is small when looking at the closest neighbor of any generated point.

Is there a more efficient method for generating points of this distribution?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.