title: Efficient data structure for storing 3d points
body: <p>I'm looking for efficient data structures for storing 3d points (x,y,z). The effect of storing in at the points in a data structure should generate a more memory efficient structure and a faster search for a specific set of coordinates. The 3d points is mapping to a specific ID so it should be able to keep track of each set of coordinates I'm looking for any implementation which is available.</p>
  
  <p><strong>x, y, z</strong> gives the cartesian coordinates of each node. </p>
  
  <p>id x y z</p>
  
  <p>1 14.566132 34.873772 7.857000</p>
  
  <p>2 16.022520 33.760513 7.047000</p>
  
  <p>3 17.542000 32.604973 6.885001</p>
  
  <p>4 19.163984 32.022469 5.913000</p>
  
  <p>5 20.448090 30.822802 4.860000</p>
  
  <p>6 21.897903 28.881084 3.402000</p>
  
  <p>7 18.461960 30.289471 8.586000</p>
  
  <p>8 19.420759 28.730757 9.558000</p>
  
  <p>The number of coordinates will be huge maybe around 1 000 000.</p>
  
  <p>Thanks in advance!</p>