A near-quadratic algorithm for the alpha-connected two-center problem

Journal of Information Science and Engineering

Volumn 22, Issue 6, 2006, Pages 1317-1324

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

^a TAMKANG UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

^c NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Alpha connected two center problem; Circular hull; Computational geometry; P center problem

Indexed keywords

COMPUTATIONAL GEOMETRY; INFORMATION SCIENCE; PROBLEM SOLVING; SET THEORY;

ALPHA CONNECTED TWO CENTER PROBLEM; CIRCULAR HULL; CONGRUENT CLOSED DISKS; P CENTER PROBLEM;

ALGORITHMS;

EID: 33751535503     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. P. Agarwal and M. Sharir, "Planar geometric location problems," Algorithmica, Vol. 11, 1994, pp. 185-195.
2. M. de Berg, P. Bose, D. Bremner, S. Ramaswami, and G. Wilfong, "Computing constrained minimum-width annuli of point sets," Computer-Aided Design, Vol. 30, 1998, pp. 267-275.
3. T. M. Chan, "More planar two-center algorithms," Computational Geometry: Theory and Applications, Vol. 13, 1999, pp. 189-198.
4. F. Chin and C. A. Wang, "Optimal algorithms for intersection and minimum distance problems between planar polygons," IEEE Transactions on Computers, Vol. C-32, 1983, pp. 1203-1207.
5. Z. Drezner, Facility Location: A Survey of Applications and Methods, Springer Verlag, New York, 1995.
6. Z. Drezner, "The planer two-center and two-median problems," Transportation Science,Vol. 18, 1984, pp. 351-361.
7. H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel, "On the shape of a set of points in the plane," IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 551-559.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, V. 10, Springer Verlag, New York, 1987.
9. D. Eppstein, "Dynamic three-dimensional linear programming," ORSA Journal on Computing, Vol. 4, 1992, pp. 360-368.
10. D. Eppstein, "Feister construction of planar two-centers," in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 131-138.
11. J. Hershberger, "A faster algorithm for the two-center decision problem," Information Processing Letters, Vol. 47, 1993, pp. 23-29.
12. J. Hershberger and S. Suri, "Finding tailored partitions," Journal of Algorithms, Vol. 12, 1991, pp. 431-463.
13. C. H. Huang, "Some problems on radius-weighted model of packet radio network," Ph. D. Dissertation, Department of Computer Science, Tsing Hua University, Taiwan, 1992.
14. N. F. Huang, C. H. Huang, and Y. L. Wang, "A sweepline algorithm to solve the two-center problem," Information Processing Letters, Vol. 49, 1994, pp. 171-177.
15. P. H. Huang, Y. T. Tsai, and C. Y. Tang, "A fast algorithm for the alpha-connected two-center decision problem," Information Processing Letters, Vol. 85, 2003, pp. 205-210.
16. R. Z. Hwang, R. C. T. Lee, and R. C. Chang, "The slab dividing approach to solve the euclidean P-center problem," Algorithmica, Vol. 9, 1993, pp. 1-22.
17. J. Jaromczyk and M. Kowaluk, "An efficient algorithm for the Euclidean two-center problem," in Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 303-311.
18. M. Katz and M. Sharir, "An expander-based approach to geometric optimization," in Proceedings of the 9th ACM Symposium on Computational Geometry, 1993, pp. 198-207.
19. N. Meggido, "Applying parallel computation algorithms in the design of serial algorithms," Journal of the ACM, Vol. 30, 1983, pp. 852-865.
20. 3 and related problems," SIAM Journal of Computing, Vol. 12, 1983, pp. 759-776.
21. N. Megiddo and K. Supowit, "On the complexity of some common geometric location problems," SIAM Journal of Computing, Vol. 13, 1984, pp. 1182-1196.
22. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, 1985.
23. M. Sharir, "A near-linear algorithm for the planar 2-center problem," in Proceedings of the 12th ACM Symposium on Computational Geometry, 1996, pp. 106-112.