Incremental and Decremental Maintenance of Planar Width
Computational Geometry
2010-01-21 v2
Abstract
We present an algorithm for maintaining the width of a planar point set dynamically, as points are inserted or deleted. Our algorithm takes time O(kn^epsilon) per update, where k is the amount of change the update causes in the convex hull, n is the number of points in the set, and epsilon is any arbitrarily small constant. For incremental or decremental update sequences, the amortized time per update is O(n^epsilon).
Cite
@article{arxiv.cs/9809038,
title = {Incremental and Decremental Maintenance of Planar Width},
author = {David Eppstein},
journal= {arXiv preprint arXiv:cs/9809038},
year = {2010}
}
Comments
7 pages; 2 figures. A preliminary version of this paper was presented at the 10th ACM/SIAM Symp. Discrete Algorithms (SODA '99); this is the journal version, and will appear in J. Algorithms