Minimizing average distance to closest station inside a square
I have the following problem: I have a square of area M. In the square, I can place P stations however I like. After that, I link every point in the square (and on its edge) to the closest station. My goal is to minimize the average distance of points to their closest stations.
Minimzing Average Distance to Closest Station inside a Sqaure
I have the following problem: I have a square of area M. In the square, I can place P stations however I like. After that, I link every point in the square (and on its edge) to the closest station. My goal is to minimize the average distance of points to their closest stations.