For some insertion
orders, the resulting search structure may have quadratic size and linear search
time. 6.838, Computational Geometry; Fall 2001
Point Location
Sergi Elizalde & David Pritchard
For some insertion
orders, the resulting search structure may have quadratic size and linear search
time.
For other permutations
it is much better.
We took a random
insertion sequence, so we are interested in the expected performance.
The expected
time is the average of the running time, taken over all n! permutations
Theorem.
- This algorithm computes T and D in O(n log n) expected time
- The expected size of D is O(n)
- For any query point q the expected query time is O(log n)