Abstract
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in 0(√n log3) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known.
Cite
CITATION STYLE
APA
Chan, T. M. (2003). A fully dynamic algorithm for planar width. In Discrete and Computational Geometry (Vol. 30, pp. 17–24). Springer New York. https://doi.org/10.1007/s00454-003-2923-8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free