Quad/Oct Tree

• Start from a bounding square/cube of the points

• In each point of the tree partition the node into 4 squares.

• Continue recursively, ua node is empty or contains one point.

Notes: