Quad Trees
*
*
*
*
*
*
*
*
*
*
*
*
*
• Each
interior node corresponds
to a square region (or k-dimen)
• When
there are too many points
in the region to fit into a block,
split it in 4.
• Access algorithms similar to those
of KD-trees.
0
100
400K
Age
Salary