R trees logic on split
<p>I am trying to construct an R+ tree for indexing multidimensional data.. Now i am concentrating on 2D data using rectangles.Consider that I have M (the upper bound of the number of rectangles allowed in an R+ tree node ) is 4 and while inserting, I get all concentric rectangles.When I get a 5th concentric rectangle,I need to split the node.. How should I split them.. I have done the R tree data structure.. but in that overlapping of non leaf nodes is allowed. In R+ trees, overlapping of non leaf nodes is not allowed.. 
When I get number of data rectangles more than M, I need to split it and a new root (with two rectangles that bounds the children )is created.. But in case of R+ trees, i need the elements in the root to be disjoint but how can it be made possible with all data rectangles concentric??</p>

<p>Anyone please suggest me a logic to solve this problem...</p>
