This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Complexity of Two Circle Strongly Connecting Problems
September 1992 (vol. 41 no. 9)
pp. 1185-1188

Given n demand points in the plane, the circle strongly connecting problem (CSCP) is to locate n circles in the plane, each with its center in a different demand point, and determine the radius of each circle such that the corresponding digraph G=(V, E), in which a vertex nu /sub 1/ in V stands for the point p/sub i/, and a directed edge ( nu /sub i/, nu /sub j/) in E, if and only if p/sub j/ located within the circle of p/sub i/, is strongly connected, and the sum of the radii of these n circles is minimal. The constrained circle strongly connecting problem is similar to the CSCP except that the points are given in the plane with a set of obstacles and a directed edge ( nu /sub i/, nu /sub j/) in E, if and only if p/sub j/ is located within the circle of p/sub i/ and no obstacles exist between them. It is proven that both these geometric problems are NP-hard. An O(n log n) approximation algorithm that can produce a solution no greater than twice an optimal one is also proposed.

[1] R. C. Chang and R. C. T. Lee, "AnO(nlogn) minimal spanning tree algorithm for n points in the plane,"BIT, vol. 26, pp. 7-16, 1986.
[2] L. P. Chew, "Constrained Delaunay triangulations,"Algorithmica, vol. 4, pp. 97-108, 1989.
[3] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[4] D. T. Lee and B. J. Schachter, "Two algorithms for constructing Delaunay triangulations,"Int. J. Comput. Inform. Sci., vol. 9, no. 3, pp. 219-242, 1980.
[5] A. Lingas, "Voronoi diagrams with barriers and the shortest diagonal problem,"Inform. Processing Lett., vol. 32, pp. 191-198, 1989.
[6] N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems,"SIAM J. Comput., vol. 13, no. 1, pp. 182-196, 1984.
[7] M. I. Shamos,Computational Geometry, New York: Springer-Verlag, 1977.
[8] C. Wang and L. Schubert, "An optimal algorithm for constructing the Delaunay triangulation of a set of line segments," inProc. 3rd ACM Symp. Computat. Geometry, Waterloo, 1987, pp. 223-232.
[9] D. W. Wang and Y. S. Kuo, "A study on two geometric location problems,"Inform. Processing Lett., vol. 28, pp. 281-286, 1988.

Index Terms:
complexity; circle strongly connecting problems; demand points; plane; radius; digraph; directed edge; NP-hard; approximation algorithm; computational complexity; computational geometry; directed graphs.
Citation:
Nen-Fu Huang, "On the Complexity of Two Circle Strongly Connecting Problems," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1185-1188, Sept. 1992, doi:10.1109/12.165400
Usage of this product signifies your acceptance of the Terms of Use.