NN Using Quadtree

• Observation: The quadtree nodes can be easily travesed according to this ordering

• Nodes to be visited are "adjacent".

• Use heap to perform this traversal of the quadtree.

• Stop as soon as the lower bound is higher than the distance to the closest point found.

Notes: