Fast Point Location - Cont'

Of the hight of the quadtree is L, we perform point location in O(log L) time.
If L=32 then about 5 memory accesses are needed - for routing a packet in the internet.
Idea was discovered intependently several times.

Of the hight of the quadtree is L, we perform point location in O(log L) time.