Fast Point Location

Point location -> find the point in the quad tree where we 'fall off' the tree.
Observation: We know the path in advance!
Idea: Insert all nodes of the audatree into a hash (enumerate them in a unique way).
Perform binary search for the termination point.

Point location -> find the point in the quad tree where we 'fall off' the tree.