Sciweavers

Share
COMPGEOM
2001
ACM

A fully dynamic algorithm for planar

9 years 11 months ago
A fully dynamic algorithm for planar
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
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2001
Where COMPGEOM
Authors Timothy M. Chan
Comments (0)
books