6.838, Computational Geometry; Fall 2001

Point Location

Sergi Elizalde & David Pritchard

Proof: Expected Construction Time is O(n log n)

The time to insert segment s_i is O(k_i) plus the time needed to locate the left endpoint of s_i in T(S_i-1).
So, the expected running time of the algorithm is