title: Find coordinate at minimum distance from list of coordinates
body: <p>I have a list of coordinates in 2D space (x<sub>i</sub>, y<sub>i</sub>). How can I find a coordinate (X, Y) such that the distance between it and the other given coordinates is minimum? Is there a mathematical formula to solve for (X, Y)?</p>
  
  <p>Let me give an example..
  Lets say i have list of co.ordinates (0,0);(1,0);(0,1);(-1,0);(0,-1);
  Now i have to findout possible co.ordinate(s)(one or many) such that the resulting co.ordinate is at minimun distance from all the points. in this case (0,0).</p>
  
  <p>As Voo said,This is my requirement :
  <strong>Find a point that minimizes the sum of the distances to the points in a given set</strong></p>