A fully dynamic algorithm for planar

Authors:
Timothy M. Chan
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Year:
2001

Citing 9
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Linear optimization queries

Journal of Algorithms
Off-line dynamic maintenance of the width of a planar point set

Computational Geometry: Theory and Applications
Applications of a semi-dynamic convex hull algorithm

BIT
Average case analysis of dynamic geometric optimization

Computational Geometry: Theory and Applications
New techniques for some dynamic closest-point and farthest-point problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental and decremental maintenance of planar width

Journal of Algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time

Journal of the ACM (JACM)

Dynamic subgraph connectivity with geometric applications

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Semi-online maintenance of geometric optima and measures

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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