### r-tree

#### How does R+-Tree manages intersecting objects?

Lets suppose in R-Tree we can hold maximum 4 elements in a leaf. Does it makes impossible to index more than 4 objects having common overlapping part? See the picture: all the 5 objects share the region covered by object 5. In R+-Tree internal nodes cannot overlap, so 4-leafs-R+-tree cannot have such a node that covers object 5 correctly. Is that correct? How this is handled in real GIS systems where many objects may have massively intersecting MBRs (Minimum Bounding Rect)? (The simplest idea is to have enough leaf capacity).

Let bounding boxes overlap - that's the key idea of r-trees. If you do that everything works fine, but for some reason it bothers people.

### Related Links

How does R+-Tree manages intersecting objects?

Why does the unique R-Tree node appear to be in two enclosing rectangles?

ELKI DBSCAN R* tree index

R-Tree vs R+-Tree vs R*-Tree

How to bulk-load an r-tree in C#?

how to construct a RTree using given data points