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]
Uložené v:
| Vydané v: | Discrete & computational geometry Ročník 30; číslo 1; s. 17 - 24 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer Nature B.V
01.07.2003
|
| Predmet: | |
| ISSN: | 0179-5376, 1432-0444 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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] |
|---|---|
| Bibliografia: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0179-5376 1432-0444 |
| DOI: | 10.1007/s00454-003-2923-8 |