A fast algorithm for the alpha-connected two-center decision problem

Information Processing Letters

Volumn 85, Issue 4, 2003, Pages 205-210

  Huang, Po Hsueh ^a   Tsai, Yin Te ^b   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Alpha connected two center decision problem; Center hull; Computational geometry; k center problem; Two center decision problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; MATRIX ALGEBRA; PROBLEM SOLVING;

DATA STRUCTURE;

DECISION THEORY;

EID: 0037469751     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00402-7     Document Type: Article

References (24)

1. Agarwal P., Sharir M. Planar geometric location problems. Algorithmica. 11:1994;185-195.
2. Chan T.M. More planar two-center algorithms. Comput. Geometry: Theory and Appl. 13:1999;189-198.
3. Chin F., Wang C.A. Optimal algorithms for intersection and minimum distance problems between planar polygons. IEEE Trans. Comput. C-32:1983;1203-1207.
4. Drezner Z. Facility Location: A Survey of Applications and Methods. 1995;Springer, New York.
5. Drezner Z. The planer two-center and two-median problems. Transportation Sci. 18:1984;351-361.
6. Edelsbrunner H., Kirkpatrick D.G., Seidel R. On the shape of a set of points in the plane. IEEE Trans. Inform. Theory. IT-29:1983;551-559.
7. Edelsbrunner H. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. 10:1987;Springer, New York.
8. Eppstein D. Dynamic three-dimensional linear programming. ORSA J. Comput. 4:1992;360-368.
9. Eppstein D. Faster construction of planar two-centers. 8th ACM-SIAM Symp. Discrete Algorithms. 1997;131-138.
10. Guibas L.J., Knuth D.E., Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 7:1992;381-413.
11. Hershberger J. A faster algorithm for the two-center decision problem. Inform. Process. Lett. 47:1993;23-29.
12. Hershberger J., Suri S. Finding tailored partitions. J. Algorithms. 12:1991;431-463.
13. Huang C.H. Some problems on radius-weighted model of packet radio network, Ph.D. Dissertation. 1992;Department of Computer Science, Tsing Hua University, Hsinchu, Taiwan.
14. Huang N.F., Huang C.H., Wang Y.L. A sweepline algorithm to solve the two-center problem. Inform. Process. Lett. 49:1994;171-177.
15. Hwang R.Z., Lee R.C.T., Chang R.C. The slab dividing approach to solve the Euclidean P-center problem. Algorithmica. 9:1993;1-22.
16. Jaromczyk J., Kowaluk M. An efficient algorithm for the Euclidean two-center problem. 10th ACM Symp. Computational Geometry. 1994;303-311.
17. Katz M., Sharir M. An expander-based approach to geometric optimization. 9th ACM Symp. Computational Geometry. 1993;198-207.
18. Meggido N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. 30:1983;852-865.
19. Megiddo N. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput. 12:1983;759-776.
20. Megiddo N., Supowit K. On the complexity of some common geometric location problems. SIAM J. Comput. 13:1984;1182-1196.
21. Overmars M.H., van Leeuwen J. Maintenance of configurations in the plane. J. Comput. System Sci. 23:1981;166-204.
22. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction. 1985;Springer, New York.
23. Shamos M.I. Computational geometry, Ph.D. Dissertation. 1978;Dept. of Comput. Sci., Yale University, New Haven, CT.
24. Sharir M. A near-linear algorithm for the planar 2-center problem. 12th ACM Symp. Computational Geometry. 1996;106-112.