Maintenance of Geometric Extrema ∈

Journal of the ACM (JACM)

Volumn 38, Issue 2, 1991, Pages 275-298

  Dobkin, David ^a   Suri, Subhash ^b  

^a PRINCETON UNIVERSITY   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

decomposability; dynamization; geometric algorithms; semi online model; Voronoi diagram

Indexed keywords

EID: 0005377778     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/103516.103518     Document Type: Article

References (20)

1. AGGARWAL, A., AND SURI, S. Fast algorithms for computing the largest empty rectangle (extended abstract). Proceedings of the 3rd Annual Symposium on Computational Geometry. 1987, pp. 278-290.
2. BENTLEY, J., AND SAXE J. Decomposable searching problems I. Static-to-dynamic transformation. J. Alg. 1 (1980), 301-358.
3. BENTLEY, J., AND SHAMOS, M. Divide-and-conquer in multidimensional space. In Proceedings of the 8th ACM Symposium on Theory of Computing. ACM, New York, 1976, pp. 220-230.
4. CHAZELLE, B. HOW to search in history. Inf. Cont. 64 (1985), 77-99.
5. CHAZELLE, B., DRYSDALE. R., AND LEE, D. T. Computing the largest empty rectangle. SIAM J. Comput 15 (1986), 300-315.
6. CHAZELLE, B., AND FRIEDMAN, J. A deterministic view of random sampling and its use in geometry. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1988, pp. 539-549.
7. CHAZELLE, B., AND GUIBAS, L. Fractional Cascading: I and II Algorithmica 1 (1986), 133-191.
8. COLE, R., SHARIR, M., AND YAP, C. On k-hulls and related problems. SIAM J. Comput. 16 (1987), 61-77.
9. COLE, R., AND YAP, C. Geometric retrieval problems Inf. Control 63 (1984). 39-57.
10. EDELSBRUNNER, H. Algorithms in Combinatorial Geometry. Springer-Verlag, New York. 1987.
11. EDELSBRUNNER, H., GUIBAS, L, AND STOLFI, J. Optimal point location in monotone subdivision. SIAM J. Comput. 15 (1986), 317-340.
12. EDELSBRUNNER. H., AND OVERMARS, M. Batched dynamic solutions to decomposable searching problems. J. Alg. 6 (1985), 515-542.
13. GABOW, H., AND TARJAN, R. A linear-time algorithm for a special case of disjoint set union J. Comput. Syst. Sci. 30 (1985). 209-221.
14. LEE, D. T. Two-dimensional Voronoi diagram in the Lp-metric. J. ACM. 27. 4 (Oct. 1980), 604-618
15. LEE, D. T., AND CHING, Y. The power of geometric duality revisited. Inf. Proc. Lett. 21 (1985). 117-122.
16. OVERMARS, M Dynamization of order decomposable set problems J. Alg 2 (1981). 245-260.
17. OVERMARS, M., AND VAN LEEUWEN. J Maintenance of configurations in the plane. J Comput. Sys. Sci. 23 (1981). 166-204.
18. PREPARATA, F., AND SHAMOS, M. Computational Geometry. Springer-Verlag, New York. 1985.
19. SEIDEL, R. A convex hull algorithm optimal for points in even dimensions. Rep. 81-14 Dept. of Computer Science, University of British Columbia. Vancouver, British Columbia, 1981.
20. YAO, A. C. On constructing minimum spanning trees in A-dimensional space and related problems. SIAM J. Computing 11 (1982), 721-736.