A fully dynamic algorithm for planar width

Discrete and Computational Geometry

Volumn 30, Issue 1, 2003, Pages 17-24

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037971852     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2923-8     Document Type: Conference Paper

References (21)

1. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.
2. P. K. Agarwal and M. Sharir. Off-line dynamic maintenance of the width of a planar point set. Comput. Geom. Theory Appl., 1:65-78, 1991.
3. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4:591-604, 1989.
4. J. Bentley and J. Saxe. Decomposable searching problems, I: static-to-dynamic transformation. J. Algorithms, 1:301-358, 1980.
5. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proc. 43rd IEEE Sympos. Foundations of Computer Science, pages 617-626, 2002.
6. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. Assoc. Comput. Mach., 48:1-12, 2001.
7. T. M. Chan. Semi-online maintenance of geometric optima and measures. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 474-483, 2002.
8. B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509-517, 1985.
9. D. Eppstein. Dynamic three-dimensional linear programming. ORSA J. Comput., 4:360-368, 1992.
10. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom., 13:111-122, 1995.
11. D. Eppstein. Average case analysis of dynamic geometric optimization. Comput. Geom. Theory Appl., 6:45-68, 1996.
12. D. Eppstein. Incremental and deremental maintenance of planar width. J. Algorithms, 37:570-577, 2000.
13. J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
14. M. E. Houle and G. T. Toussaint. Computing the width of a set. IEEE Trans. Pattern Anal. Mach. Intell, PAMI-10:761-765,1988.
15. R. Janardan. On maintaining the width and diameter of a planar point-set online. Internat. J. Comput. Geom. Appl., 3:331-344, 1993.
16. J. Matoušek. Linear optimization queries. J. Algorithms, 14:432-448, 1993.
17. K. Mehlhorn. Data Structures and Algorithms, 3: Multi-Dimensional Searching and Computational Geometry. Springer-Verlag, Heidelberg, 1984.
18. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. System Sci., 23:166-204, 1981.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
20. G. Rote, C. Schwarz, and J. Snoeyink. Maintaining the approximate width of a set of points in the plane. In Proc. 5th Canad. Conf. Computational Geometry, pages 258-263, 1993.
21. K. J. Supowit. New techniques for some dynamic closest-point and farthest-point problems. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 84-90, 1990.