The discrete 2-center problem

Discrete and Computational Geometry

Volumn 20, Issue 3, 1998, Pages 287-305

  Agarwal, P K ^a   Sharir, M ^b,c   Welzl, E ^d  

^a Duke University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032344347     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009387     Document Type: Article

References (15)

1. P. K. Agarwal, On stabbing lines for convex polyhedra in 3D, Comput. Geom. Theory Appl. 4 (1994), 177-189.
2. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane, Algoritmica 9 (1993), 495-514.
3. P. K. Agarwal and M. Sharir, Planar geometric location problems, Algorithmica 11 (1994), 185-195.
4. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
5. K. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
6. D. Eppstein, Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 131-138.
7. J. Hershberger and S. Suri, Finding tailored partitions, J. Algorithms 12 (1991), 431-463.
8. J. Jaromczyk and M. Kowaluk, An efficient algorithm for the Euclidean two-center problem, Proc. 10th ACM Symp. on Computational Geometry, 1994, pp. 303-311.
9. M. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput. 26 (1997), 1384-1408.
10. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986), 59-71.
11. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
12. N. Megiddo and K. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput. 13 (1984), 1182-1196.
13. M. Reichling, On the detection of a common intersection of k convex objects in the plane, Inform. Process. Lett. 29 (1988), 25-29.
14. M. Sharir, A near-linear algorithm for the planar two-center problem, Discrete Comput. Geom. 18 (1997), 125-134.
15. A. Tamir, Improved complexity bounds for center location problem on networks by using dynamic data structures, SIAM J. Discrete Math. 1 (1988), 377-396.