Semi-online maintenance of geometric optima and measures

SIAM Journal on Computing

Volumn 32, Issue 3, 2003, Pages 700-716

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational geometry; Dynamic data structures

Indexed keywords

DATA STRUCTURES; DYNAMIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TIME DOMAIN ANALYSIS;

DYNAMIC DATA STRUCTURES; GEOMETRIC OPTIMIZATION; HAUSDORFF DISTANCE; SEMI ONLINE MODEL;

COMPUTATIONAL GEOMETRY;

EID: 0038299454     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702404389     Document Type: Article

References (28)

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., AMS, Providence, RI, 1999, pp. 1-56.
2. P. K. Agarwal and J. Motoušek, On range searching with semi-algebraic sets, Discrete Comput. Geom., 11 (1994), pp. 393-416.
3. P. K. Agarwal and J. Matoušek, Dynamic half-space range reporting and its applications, Algorithmica, 13 (1995), pp. 325-345.
4. P. K. Agarwal, M. Sharir, and E. Welzl, The discrete 2-center problem, Discrete Comput. Geom., 20 (1998), pp. 287-305.
5. J. Bentley and J. Saxe, Decomposable searching problems I: Static-to-dynamic transformation, J. Algorithms, 1 (1980), pp. 301-358.
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 (1998), pp. 473-484.
7. H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom., 14 (1995), pp. 263-279.
8. T. M. Chan, A fully dynamic algorithm for planar width, Discrete Comput. Geom., to appear.
9. L. P. Chew, D. Dor, A. Efrat, and K. Kedem, Geometric pattern matching in d-dimensional space, Discrete Comput. Geom., 21 (1999), pp. 257-274.
10. Y.-J. Chiang and R. Tamassia, Dynamic algorithms in computational geometry, Proc. IEEE, 80 (1992), pp. 1412-1434.
11. D. Dobkin and S. Suri, Maintenance of geometric extrema, J. ACM, 38 (1991), pp. 275-298.
12. A. Dumitrescu, J. S. B. Mitchell, and M. Sharir, Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles, in Proceedings of the 17th ACM Symposium on Comput. Geom., Association for Computing Machinery, New York, 2001, pp. 141-150.
13. D. Eppstein, Dynamic three-dimensional linear programming, ORSA J. Comput., 4 (1992), pp. 360-368.
14. D. Eppstein, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom., 13 (1995), pp. 111-122.
15. D. Eppstein, Average case analysis of dynamic geometric optimization, Comput. Geom. Theory Appl., 6 (1996), pp. 45-68.
16. D. Eppstein, Incremental and decremental maintenance of planar width, J. Algorithms, 37 (2000), pp. 570-577.
17. 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 (1999), pp. 569-592.
18. J. Erickson, Klee's Measure Problem, available at http://compgeom.cs.uiuc.edu/~jeffe/open/klee.html, 1998.
19. H. Freeman and R. Shapira, Determining the minimum-area encasing rectangle for an arbitrary closed curve, Commun. ACM, 18 (1975), pp. 409-413.
20. J.-M. Ho, D. T. Lee, C.-H. Chang, and C. K. Wong, Minimum diameter spanning trees and related problems, SIAM J. Comput., 20 (1991), pp. 987-997.
21. J. Matoušek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
22. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl., 2 (1992), pp. 169-186.
23. J. Matoušek, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp. 157-182.
24. K. Mehlhorn, Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
25. M. H. Overmars, The Design of Dynamic Data Structures, Lecture Notes in Comput. Sci. 156, Springer-Verlag, Heidelberg, 1983.
26. M. H. Overmars and C.-K. Yap, New upper bounds in Klee's measure problem, SIAM J. Comput., 20 (1991), pp. 1034-1045.
27. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
28. M. Smid, Closest-point problems in computational geometry, in Handbook of Computational Geometry, J. Urrutia and J. Sack, eds., North-Holland, Amsterdam, 2000, pp. 877-935.