Incremental and decremental maintenance of planar width

David Eppstein
J. Algorithms 37(2):570–577, Nov 2000
Proc. 10th Symp. Discrete Algorithms, ACM and SIAM, Jan 1999, pp. S899–S900
ACM Computing Research Repository, cs.CG/9809038
Mathematical Reviews 2001g:68095
http://dx.doi.org/10.1006/jagm.2000.1107

Cited by:

• A fully dynamic algorithm for planar width
• Semi-online maintenance of geometric optima and measures
• A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries