Quadtree
A quadtree is a geometric data structure for storing points in two-dimensional space
R-tree
R-Tree is a popular index structure for spatial data, stored as Minimum Bounding Rectangles (MBRs).
Indexes faster nearest
| Example |
|---|
|
"Quadtree indexes are created faster than r-tree" from question R-Tree and Quadtree Comparison "R-tree are much faster than quadtree for nearest neighbours queries" from question R-Tree and Quadtree Comparison |
Better perfomance r-tree
| Example |
|---|
|
"If you can use a database you can use the point datatype or you can write your own r-tree;when you have many overlapping pins maybe a quadtree is better" from question Creating Map from scanned image |
|
"You can also try a quadtree it has some better perfomance over a r-tree" from question Optimizing search through large list of lat/long coords to find match |
Others
| Example |
|---|
|
On the other hand the wikipedia article on r-tree seems more specifically targeted towards mapping than the k-d tree or quadtree from question What spatial indexing algorithm should I use? |
|
I use quadtree more than r-tree and find them super flexible from question Spatial index with sum and count for C++ |
|
A quadtree is a simpler data structure than the r-tree from question Find nearest edge in graph |
|
R-tree are substantially faster than quadtree for window queries like inside contains covers etc from question R-Tree and Quadtree Comparison |