I have a set of points corresponding to pictures on map. Because location precision is not very important, I want to separate the points inside the set to maximize the summed up distance between the points. There would be a maximum distance that points could be moved.

Any idea what kind of algorithm should I use?

  • $\begingroup$ So you want to separate points that are close to each other so that they're easier to distinguish/click? $\endgroup$ – Simon Nov 25 '14 at 10:51
  • $\begingroup$ You want to maximize the sum of all distances between any two points, i.e. n(n-1)/2 distances? $\endgroup$ – babou Nov 25 '14 at 14:36
  • $\begingroup$ It is not clear to me that it will give you the best results, assuming I understand your purpose. If 2 points are already far apart, is there any point in increasing that distance, possibly at the expense of points that are close to each other. $\endgroup$ – babou Nov 25 '14 at 14:41
  • $\begingroup$ Yes, I want to maximize the sum of all distance between any two points. To avoid separating even more two distant points one could set a minimum threshold. So, don't move points witch are more than X separated. $\endgroup$ – Diego Cerdan Puyol Nov 26 '14 at 11:10

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.