A fully dynamic algorithm for planar
Timothy M. Chan · 2001
We show how to maintain the width of a set of $n$ planar points subjec t to insertions and deletions of points in $O(\sqrt{n}\log^3n)$ amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known.