A fully dynamic algorithm for planar width

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 172-176

  Chan, T M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; OPTIMIZATION; SET THEORY; THEOREM PROVING;

DYNAMIC ALGORITHMS; SUBLINEAR TIME BOUNDS;

DATA STRUCTURES;

EID: 0034826620     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Dynamic half-space range reporting and its applications
2. Off-line dynamic maintenance of the width of a planar point set
3. A linear-time algorithm for computing the Voronoi diagram of a convex polygon
4. Decomposable searching problems I: Static-to-dynamic transformation
5. Dynamic planar convex hull with optimal query time and O(log n · log log n) update time
6. Dynamic planar convex hull operations in near-logarithmic amortized time
7. On the convex layers of a planar set
8. Dynamic three-dimensional linear programming
9. Dynamic Euclidean minimum spanning trees and extrema of binary functions
10. Average case analysis of dynamic geometric optimization
11. Incremental and decremental maintenance of planar width
12. Applications of a semi-dynamic convex hull algorithm
13. On maintaining the width and diameter of a planar point-set online
14. Linear optimization queries
15. Maintenance of configurations in the plane
16. Maintaining the approximate width of a set of points in the plane
17. New techniques for some dynamic closest-point and farthest-point problem
18. Solving geometric problems with the rotating calipers