KD-tree vs. R-Tree
Hessam Zakerzadeh
Kd-tree vs. R-tree
• kd-trees are not balanced
(unless bulk-loaded).
• kd-trees always cover the
whole space.
• kd-trees binary split the
data space. The binary
splits are obviously disjoint.
• kd-trees only stores point
vectors.
• R-Trees are balanced.
• R-Trees do not cover the
whole data space. Empty
areas may be uncovered.
• r-trees partition the data
into rectangles. the
rectangles of an r-tree may
overlap.
• R-trees can store rectangles
and polygons as overlap is
needed for polygons.