A fully dynamic algorithm for planar

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.

• Type: Conference
• Year: 2001
• Where: COMPGEOM
• Authors: Timothy M. Chan
• Keywords: Amortized Time, COMPGEOM 2001, Discrete Geometry, Dynamic Algorithm, Planar Points