Off-Line Maintenance of Planar Configurations

Journal of Algorithms

Volumn 21, Issue 3, 1996, Pages 453-475

  Hershberger, John ^a,c   Suri, Subhash ^b,d  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

^d TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0342525224     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0054     Document Type: Article

References (18)

1. B. Chazelle, On the convex layers of a planar set, IEEE Trans. Inform. Theory IT-31(4), 509-517 (July 1985).
2. B. Chazelle and L. J. Guibas, Fractional cascading, I: A data structuring technique, Algorithmica 1, 133-162 (1986).
3. J. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan, Making data structures persistent, J. Comput. System Sci. 38, 86-124 (1989).
4. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," EATCS Monographs on Theoretical Computer Science, Vol. 10, Springer-Verlag, Berlin/New York, 1987.
5. G. N. Frederickson and S. Rodger, A new approach to the dynamic maintenance of maximal points in a plane, Discrete Comput. Geom. 5, 365-374 (1990).
6. J. Friedman, J. Hershberger, and J. Snoeyink, Compliant motion in a simple polygon, in "Proceedings of the 5th ACM Symposium on Computational Geometry," pp. 175-186, 1989.
7. H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30, 209-221 (1985).
8. L. Guibas, J. Hershberger, and J. Snoeyink, Compact interval trees: A data structure for convex hulls, Internat. J. Comp. Geom. Appl. 1(1), 1-22 (1991).
9. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13(2), 338-355 (1984).
10. J. Hershberger and S. Suri, Applications of a semi-dynamic convex hull algorithm, BIT 32 249-267 (1992).
11. K. Mehlhorn and S. Näher, Dynamic fractional cascading, Algorithmica 5, 215-241 (1990).
12. K. Mulmuley, Randomized multidimensional search trees: Lazy balancing and dynamic shuffling, in "Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science," pp. 180-196, 1991.
13. M. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23, 166-204 (1981).
14. F. P. Preparata, An optimal real time algorithm for planar convex hulls, Comm. ACM 22, 402-405 (1979).
15. F. P. Preparata and M. I. Shamos, "Computational Geometry," Springer-Verlag, New York, 1985.
16. O. Schwarzkopf, Dynamic maintenance of geometric structures made easy, in "Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science," pp. 197-206, 1991.
17. R. E. Tarjan, "Data Structures and Network Algorithms," CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, 1983.
18. D. E. Willard and G. S. Lueker, Adding range restriction capability to dynamic data structures, J. Assoc. Comput. Mach. 32, 597-617 (1985).