Talk:R+ tree
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
R+ trees differ from R trees in that:
* Nodes are not guaranteed to be at least half filled
Is it really the case for the R-Trees? The only assumption on R-Trees' leaves count is that it stays between m (min) and M (MAX) and that m<=(M/2).
Insufficient explanation
The relaxation of the requirement that each leaf with a bounding box belongs to an internal node with strictly greater than equal bounding box results in a significantly different data structure. This is not explained in the article. 46.131.57.243 (talk) 14:34, 3 February 2024 (UTC)