Abstract. We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in
amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known.
KeywordsDynamic Algorithm Planar Point Planar Width Sublinear Time
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer-Verlag New York Inc. 2003