title: Most isolated point on 2d map - algorithm
body: <p>I have a set of points, and need to know which one has the farthest euclidean distance from any other points.</p>
  
  <p>In order to get this point, I have every distance for all my points, make an average, and take the biggest average as the farthest point.</p>
  
  <p>Is there any faster way to find out that point ?</p>