title: Find the Closest intersection point in plan
body: <p>I was asked following question in interview recently: </p>
  
  <p>Let suppose you have, following grid on Cartesian coordinate system ( Quadrant I). </p>
  
  <pre><code>o - x - x - x - o
  |   |   |   |   |
  x - x - x - o - x
  |   |   |   |   |
  x - o - o - x - x
  
  where,  o =&gt; person at intersection  and  x =&gt; no person at intersection
  
  class Point {
   int x;
   int y;
   boolean hasPerson;
  }
  
  
  Point findNearestPointWhereAllPeopleCanMeet(Point[] people) {
  
  }
  </code></pre>
  
  <p>Implement a routine where given a list of people location (points), find a location(point) such that is closest point to all given point.</p>
  
  <p>How would you solve this problem ? </p>
  
  <p>1) Approach is k-d tree, but do you know any other solution ?</p>