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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 17-24 |
| Number of pages | 8 |
| Journal | Discrete and Computational Geometry |
| Volume | 30 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 2003 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'A fully dynamic algorithm for planar width'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS