A Fully Dynamic Algorithm for Planar Width
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O(([root]n)log3n) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known. [PUBLICATION ABSTRACT]
Saved in:
| Published in: | Discrete & computational geometry Vol. 30; no. 1; pp. 17 - 24 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer Nature B.V
01.07.2003
|
| Subjects: | |
| ISSN: | 0179-5376, 1432-0444 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O(([root]n)log3n) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known. [PUBLICATION ABSTRACT] |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0179-5376 1432-0444 |
| DOI: | 10.1007/s00454-003-2923-8 |