Advertisement

Discrete & Computational Geometry

, Volume 30, Issue 1, pp 17–24 | Cite as

A Fully Dynamic Algorithm for Planar Width

Abstract. We show how to maintain the width of a set of n planar points subject 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.

Keywords

Dynamic 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.

Copyright information

© Springer-Verlag New York Inc. 2003

Authors and Affiliations

  •  Chan
    • 1
  1. 1.School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 tmchan@uwaterloo.caCA

Personalised recommendations