title: minimum distance between bounding box in kdtree
body: <p>I need to find the minimum distance b/w two kdtree bounding box's of same tree in euclidean space.  Suppose each box maintain a 5 elements. I need the minimum Euclidean distance using java. </p>
  
  <pre><code>double QHRect[][] = QNode.m_NodesRectBounds;
  double RHRect[][] = RNode.m_NodesRectBounds;
  
      QHRect[][]:    5.74842E-4,7.76626E-5,6.72655E-4, 
                     0.5002329025,0.2499048942,0.25046735625
      RHRect[][]:
                     0.75006193275,0.7495593574,0.75005675875, 
                     0.999890963,0.999386589,0.99985146
  </code></pre>