有没有人会告诉我KD树和R树之间有什么区别？ [英] Could anyone tell me what's the difference between KD-tree and R-tree

问题描述

我可以看看KD-tree和R-tree的定义，可能有人告诉我KD有什么区别吗树和R树？谢谢

解决方案

R-树和 k d树基于类似的想法（空间基于轴对齐区域的分区），但主要区别是：

• d树中的节点表示分离平面，而R树中的节点表示边界框。


• k d-tree将整个空间分区为区域，而R树仅分割d-trees表示一个不相交的分区（点只属于一个区域），而R-树可能重叠。

（分区空间有很多类似的树结构：四叉树，BSP树，R *树等等）。

I look at the definition of KD-tree and R-tree, it seems that they are almost the same.

Could anyone tell me what's the difference between KD-tree and R-tree? Thanks

解决方案

R-trees and kd-trees are based on similar ideas (space partitioning based on axis-aligned regions), but the key differences are:

• Nodes in kd-trees represent separating planes, whereas nodes in R-trees represent bounding boxes.
• kd-trees partition the whole of space into regions whereas R-trees only partition the subset of space containing the points of interest.
• kd-trees represent a disjoint partition (points belong to only one region) whereas the regions in an R-tree may overlap.

(There are lots of similar kinds of tree structures for partitioning space: quadtrees, BSP-trees, R*-trees, etc. etc.)

这篇关于有没有人会告诉我KD树和R树之间有什么区别？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！