Semi-online maintenance of geometric optima and measures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 474-483

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION;

CONVEX HULL; DECISION VERSION; GEOMETRIC OPTIMIZATION; HAUSDORFF DISTANCE; MINIMUM ENCLOSING RECTANGLE; SEMI-ONLINE; SUBLINEAR; THREE DIMENSIONS;

GEOMETRY;

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

References (24)

1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, and R. Pollack, eds.), pp. 1-56, AMS Press, 1999.
2. P. K. Agarwal and J. Matousek. On range searching with semi-algebraic sets. Discrete Comput. Geom., 11:393-416, 1994.
3. P. K. Agarwal and J. Matousek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.
4. P. K. Agarwal, M. Sharir, and E. Welzl. The discrete 2-center problem. Discrete Comput. Geom., 20:287-305, 1998.
5. J. Bentley and J. Saxe. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms, 1:301-358, 1980.
6. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom., 19:473-484, 1998.
7. T. M. Chan. A fully dynamic algorithm for planar width. In Proc. 17th ACM Sympos. Comput. Geom., pages 172-176, 2001.
8. L. P. Chew, D. Dor, A. Efrat, and K. Kedem. Geometric pattern matching in d-dimensional space. Discrete Comput. Geom., 21:257-274, 1999.
9. Y.-J. Chiang and ft. Tamassia. Dynamic algorithms in computational geometry. Proc. of the IEEE, 80:1412-1434, 1992.
10. D. Dobkin and S. Suri. Maintenance of geometric extrema. J. ACM, 38:275-298, 1991.
11. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Corn-put. Geom., 13:111-122, 1995.
12. D. Eppstein. Average case analysis of dynamic geometric optimization. Comput. Geom. Theory Appl., 6:45-68, 1996.
13. D. Eppstein. Incremental and décrémentai maintenance of planar width. J. Algorithms, 37:570-577, 2000.
14. D. Eppstein and J. Erickson. Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Discrete Comput. Geom., 22:569-592, 1999.
15. J. Erickson. Klee's measure problem. http://compgeoiD.es. uiuc. edu/" jel f e/open/klae.html.
16. J.-M. Ho, D. T. Lee, C.-H. Chang, and C.-K. Wong. Minimum diameter spanning trees and related problems. SIAM J. Comput, 20:987-997, 1991.
17. J. Matousek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
18. J. Matousek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2:169-186, 1992.
19. J. Matousek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10:157-182, 1993.
20. K. Mehlhorn. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer-Verlag, Heidelberg, 1984.
21. M. H. Overmars. The Design of Dynamic Data Structures. Lect. Notes in Comput. Sci., Vol. 156, SpringerVerlag, 1983.
22. M. Overmars and C.-K. Yap. New upper bounds in Klee's measure problem. SIAM J. Comput., 20:1034-1045, 1991.
23. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
24. M. Smid. Closest-point problems in computational geometry. In Handbook of Computational Geometry (J. Urrutia and J. Sack, ed.), pages 877-935, 2000.