Here’s paper which has pretty nice comparison of QuadTrees and R Trees: Quadtree and R-tree Indexes in Oracle Spatial: A Comparison using GIS Data Some differences: Quadtrees require fine-tuning by choosing appropriate tiling level in order to optimize performance. No specific tuning is required for R-Trees. Quadtree can be implemented on top of existing B-tree. … Read more
There is no clear answer to your question. It depends entirely how your data is organized. Something to keep in mind: Quadtrees work best for data that is mostly two dimensional like map-rendering in navigation systems. In this case it’s faster than octrees because it adapts better to the geometry and keeps the node-structures small. … Read more
Efficient Quadtrees All right, I’ll take a shot at this. First a teaser to show the results of what I’ll propose involving 20,000 agents (just something I whipped up real quick for this specific question): The GIF has extremely reduced frame rate and significantly lower res to fit the 2 MB maximum for this site. … Read more