title: R-Tree and Quadtree Comparison
body: <p>I want to compare the R-Tree and the Quadtree for geospatial data. While there is literature out there I struggle to find documents that cover real basic comparison. So I decided to ask this question.</p>
  
  <p>In my opinion, the R-Tree has the advantage of being balanced and the tree has no empty leaves.
  As a disadvantage, the basic operation like insert or delete could result in restructering the whole index.</p>
  
  <p>The Quadtree is the opposite, it is not balanced and has empty leaves, but it does not need to be restrctured. </p>
  
  <p>So as a fazit from that I would say that the R-Tree does need less memory and is faster for searching because of the minimal height. 
  The quadtree is better when there are many update-operations, but the resulting tree could be unbalanced.</p>
  
  <p>Are these points correct in your opinion?
  Are there any good documents out there that cover this topic?</p>
  
  <p>Auf Wiedersehen, Andre</p>