A fully dynamic algorithm for planar

13 years 8 months ago

Download www.cs.uwaterloo.ca

We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known.

Timothy M. Chan

Real-time Traffic

Amortized Time | COMPGEOM 2001 | Discrete Geometry | Dynamic Algorithm | Planar Points |

claim paper

» Fast 3Coloring TriangleFree Planar Graphs

» Devicelevel early floorplanning algorithms for RF circuits

» Improved data structures for fully dynamic biconnectivity

» Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink

» QuasiFully Dynamic Algorithms for TwoConnectivity Cycle Equivalence and Related Problems

» Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse...

» Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

» Fully Dynamic Algorithms for Bin Packing Being mostly Myopic Helps

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	COMPGEOM
Authors	Timothy M. Chan

Comments (0)

Sciweavers

A fully dynamic algorithm for planar

Amortized Time | COMPGEOM 2001 | Discrete Geometry | Dynamic Algorithm | Planar Points |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers