title: Best suitable approach to find nearest neighbour to (x, y, z) from list of triplets
body: <p>I am trying to obtain a triplet from list of triplets that is closest to my required triplet incase if it was not found.</p>
  <p>For example:</p>
  <pre><code>           # V_s,V_g,V_r 
  triplets = [(500, 12, 5), 
             (400, 15, 2.5), 
             (400, 15, 3),
             (450, 12, 3),
             ... ,
             (350, 14, 3)]
  </code></pre>
  <p>The triple that I am looking for is</p>
  <pre><code>req_triplet = (450, 15, 2)    #(Vreq_s, Vreq_g, Vreq_r)
  </code></pre>
  <p>How can I achieve this in python, a best suitable strategy to achieve is what I am in need for.</p>
  <p>As of now I am thinking to filter the list by finding nearest parameter V_s. From the resulting list filter further by finding nearest to V_g and finally by V_r.</p>