title: R-Tree Implementation Java
body: <p>I was searching the last few days for a stable implementation of the R-Tree with support of unlimited dimensions (20 or so would be enough). I only found this <a href="http://sourceforge.net/projects/jsi/" rel="noreferrer">http://sourceforge.net/projects/jsi/</a> but they only support 2 dimensions.</p>
  
  <p>Another Option would be a multidimensional implementation of an interval-tree. </p>
  
  <p>Maybe I'm completly wrong with the idea of using an R-Tree or Intervall-Tree for my Problem so i state the Problem in short, that you can send me your thoughts about this.</p>
  
  <p>The Problem I need to solve is some kind of nearest-neighbour search. I have a set of Antennas and rooms and for each antenna an interval of Integers. E.g. antenna 1, min -92, max -85. In fact it could be represented as room -> set of antennas -> interval for antenna. 
  The idea was that each room spans a box in the R-Tree over the dimension of the antennas and in each dimension by the interval. </p>
  
  <p>If I get a query with N-Antennas and values for each antenna I then could just represent the Information as a query point in the room and retrieve the rooms "nearest" to the point. </p>
  
  <p>Hope you got an Idea of the problem and my idea. </p>