Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming

Journal of Algorithms

Volumn 27, Issue 1, 1998, Pages 147-166

  Chan, Timothy M ^a  

^a UNIVERSITY OF MIAMI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (30)

1. P. K. Agarwal and J. Matoušek, Dynamic half-space range reporting and its applications, Algorithmica 13 (1995), 325-345.
2. J. Bentley and J. Saxe, Decomposable searching problems. I. Static-to-dynamic transformation, J. Algorithms 1 (1980), 301-358.
3. J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec, Circular separability of polygons, in "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms," pp. 273-281, 1995.
4. T. M. Chan, Fixed-dimensional linear programming queries made easy, in "Proc. 12th ACM Sympos. Comput. Geom.," pp. 284-290, 1996.
5. B. Chazelle, An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM J. Comput. 21 (1992), 671-696.
6. B. Chazelle and D. P. Dobkin, Intersection of convex objects in two and three dimensions. J. Assoc. Comput. Mach. 34 (1987), 1-27.
7. B. Chazelle and J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms 21 (1996), 597-597.
8. K. L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, J. Assoc. Comput. Mach. 42 (1995), 488-499.
9. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. Assoc. Comput. Mach. 34 (1987), 200-208.
10. D. P. Dobkin and D. G. Kirkpatrick, Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27 (1983), 241-253.
11. D. P. Dobkin and D. G. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, J. Algorithms 6 (1985), 381-392.
12. D. P. Dobkin and D. G. Kirkpatrick, Determining the separation of preprocessed polyhedra: A unified approach, in "Proc. 17th Int. Colloq. Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 443, pp. 400-413, Springer-Verlag, Berlin/New York, 1990.
13. M. E. Dyer, Linear time algorithms for two- and three-variable linear programs, SIAM J. Comput. 13 (1984), 31-45.
14. M. E. Dyer, A class of convex programs with applications to computational geometry, in "Proc. 8th ACM Sympos. Comput. Geom.," pp. 9-15, 1992.
15. D. Eppstein, Dynamic three-dimensional linear programming, ORSA J. Comput. 4 (1992), 360-368.
16. D. G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm? SIAM J. Comput. 15 (1986), 287-299.
17. J. Matoušek, Linear optimization queries, J. Algorithms 14 (1993), 432-448. (Also with O. Schwarzkopf, in "Proc. 8th ACM Sympos. Comput. Geom.," pp. 16-25, 1992.)
18. J. Matoušek, Linear optimization queries, J. Algorithms 14 (1993), 432-448. (Also with O. Schwarzkopf, in "Proc. 8th ACM Sympos. Comput. Geom.," pp. 16-25, 1992.)
19. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
20. 3 and related problems, SIAM J. Comput. 12 (1983), 759-776.
21. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984), 114-127.
22. K. Mulmuley, "Computational Geometry: An Introduction through Randomized Algorithms," Prentice-Hall, Englewood Cliffs, NJ, 1993.
23. F. Nielsen and M. Yvinec, An output-sensitive convex hull algorithm for planar objects, Research Report 2575, INRIA, Sophia-Antipolis, France, 1995.
24. M. H. Overmars and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, in "Proc. 5th GI Conf. Theoret. Comput. Sci." Lecture Notes in Computer Sciences, Vol. 104, pp. 224-233, Springer-Verlag, Berlin/New York, 1981.
25. M. Reichling, On the detection of a common intersection of k convex objects in the plane, Inform. Process. Lett. 29 (1988), 25-29.
26. M. Reichling, On the detection of a common intersection of k convex polyhedra, in "Computational Geometry and Its Applications," Lecture Notes in Computer Science, Vol. 333, pp. 180-186, Springer-Verlag, Berlin/New York, 1988.
27. N. Sarnak and R. E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986), 669-679.
28. R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991), 423-434.
29. M. Sharir and E. Welzl, A combinatorial bound for linear programming and related problems, in "Proc. 9th Sympos. Theoret. Aspects Comput. Sci.," Lecture Notes in Computer Science, Vol. 577, pp. 569-579, Springer-Verlag, Berlin/New York, 1992.
30. S. Toledo, Maximizing non-linear concave functions in fixed dimension, in "Proc. 33rd IEEE Sympos. Found. Comput. Sci.," pp. 696-685, 1992.