More planar two-center algorithms

Computational Geometry: Theory and Applications

Volumn 13, Issue 3, 1999, Pages 189-198

  Chan, Timothy M ^a,b  

^a UNIVERSITY OF MIAMI   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Parametric search; Randomization; Two center

Indexed keywords

EID: 0000131150     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00019-X     Document Type: Article

References (25)

1. P.K. Agarwal, M. Sharir, Planar geometric location problems, Algorithmica 11 (1994) 185-195.
2. P.K. Agarwal, M. Sharir, Efficient algorithms for geometric optimization, Technical Report CS-1996-19, Department of Computer Science, Duke University, Durham, 1996.
3. T.M. Chan, Deterministic algorithms for 2-d convex programming and 3-d online linear programming, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 464-472. J. Algorithms 27 (1998) 147-166.
4. T.M. Chan, Deterministic algorithms for 2-d convex programming and 3-d online linear programming, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 464-472. J. Algorithms 27 (1998) 147-166.
5. B. Chazelle, An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM J. Comput. 21 (1992) 671-696.
6. B. Chazelle, J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms 21 (1996) 579-597.
7. K.L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, J. Assoc. Comput. Mach. 42 (1995) 488-499.
8. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. Assoc. Comput. Mach. 34 (1987) 200-208.
9. O. Devillers, M.J. Katz, Optimal line bipartitions of point sets, in: Proc. 7th Int. Sympos. Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1178, Springer, Berlin, 1996, pp. 45-54.
10. D.P. Dobkin, 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, Springer, Berlin, 1990, pp. 400-413.
11. M.E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, SIAM J. Comput. 15 (1986) 725-738.
12. D. Eppstein, Dynamic three-dimensional linear programming, ORSA J. Comput. 4 (1992) 360-368.
13. D. Eppstein, Faster construction of planar two-centers, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 131-138. Also Technical Report 96-12, Department of Information and Computer Science, University of California, Irvine, CA, 1996.
14. J. Hershberger, A faster algorithm for the two-center decision problem, Inform Process. Lett. 47 (1993) 23-29.
15. J. Hershberger, S. Suri, Finding tailored partitions, J. Algorithms 12 (1991) 431-463.
16. J. Hershberger, S. Suri, Off-line maintenance of planar configurations, J. Algorithms 21 (1996) 453-475.
17. J. Jaromczyk, M. Kowaluk, An efficient algorithm for the Euclidean two-center problem, in: Proc. 10th ACM Sympos. Comput. Geom., 1994, pp. 303-311.
18. M. Katz, M. Sharir, An expander-based approach to geometric optimization, in: Proc. 9th ACM Sympos. Comput. Geom., 1993, pp. 198-207.
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. F.F. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
22. N. Sarnak, R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986) 669-679.
23. M. Sharir, A near-linear algorithm for the planar 2-center problem, Discrete Comput. Geom. 18 (1997) 125-134.
24. L. Valiant, Parallelism in comparison problems, SIAM J. Comput. 4 (1975) 348-355.
25. E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: H. Maurer (Ed.), New Results and New Trends in Computer Science, Lecture Notes in Computer Science, Vol. 555, Springer, Berlin, 1991, pp. 359-370.