Storage Size

6.838, Computational Geometry; Fall 2001

Point Location

Sergi Elizalde & David Pritchard

Proof: Expected Storage Size is O(n)

The total number of nodes is bounded by

where k_{_i} = number of new trapezoids created in iteration i.

Define d(D,s) =	{	1 if D disappears from T(S_{_i}) when s is removed from S_{_i}
		0 otherwise

So, the expected amount of storage is O(n).