We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known.
Timothy M. Chan