MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A fully dynamic algorithm for planar width (2001) [6 citations — 3 self]

Download:
Download as a PDF | Download as a PS
by Timothy M. Chan
in Proc. 17th ACM Sympos. Comput. Geom
http://www.cs.uwaterloo.ca/~tmchan/wid_scg.ps.gz
Add To MetaCart

Abstract:

We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O(

Citations

1579 Computational ge-ometry - an introduction – Preparata, Shamos
136 Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry – Mehlhorn - 1984
135 Leeuwen. Maintenance of configurations in the plane – Overmars, van - 1981
85 Decomposable searching problems I: static-to-dynamic transformation – Bentley, Saxe - 1980
85 Solving geometric problems with the rotating calipers – Toussaint - 1983
70 A linear-time algorithm for computing the Voronoi diagram of a convex polygon – Aggarwal, Guibas, et al. - 1989
61 Computing the width of a set – Houle, Toussaint - 1988
54 On the convex layers of a planar set – Chazelle - 1985
44 Applications of a semi-dynamic convex hull algorithm – Hershberger, Suri - 1990
37 Linear optimization queries – Matousek - 1993
35 Dynamic Euclidean minimum spanning trees and extrema of binary functions – Eppstein - 1995
35 Dynamic half-space range reporting and its applications – Agarwal, Matousek - 1995
33 Dynamic three-dimensional linear programming – EPPSTEIN - 1992
25 Dynamic planar convex hull operations in near-logarithmic amortized time – Chan - 1999
24 Dynamic planar convex hull – Brodal, Jacob - 2002
17 Dynamic half-space range reporting and its applications. Algorithmica – Agarwal, Matousek - 1995
17 Leeuwen. Maintenance of con in the plane – Overmars, van - 1981
15 On maintaining the width and diameter of a planar point-set online – Janardan - 1993
12 New techniques for some dynamic closest-point and farthest-point problems – Supowit - 1990
12 Dynamic planar convex hull with optimal query time and O(log n log log n) update time – Brodal, Jacob - 2000
10 Semi-online maintenance of geometric optima and measures – Chan - 2002
10 Average case analysis of dynamic geometric optimization – Eppstein - 1996
8 Maintaining the approximate width of a set of points in the plane – Rote, Schwarz, et al. - 1993
7 Linear optimization queries – Matouˇsek, Schwarzkopf - 1992
5 Off-line dynamic maintenance of the width of a planar point set – Agarwal, Sharir - 1991
4 Incremental and decremental maintenance of planar width – Eppstein - 2000