Abstract
We consider the following circle placement problem: given a set of pointsp i ,i=1,2, ...,n, each of weightw i , in the plane, and a fixed disk of radiusr, find a location to place the disk such that the total weight of the points covered by the disk is maximized. The problem is equivalent to the so-called maximum weighted clique problem for circle intersection graphs. That is, given a setS ofn circles,D i ,i=1,2, ...,n, of the same radiusr, each of weightw i , find a subset ofS whose common intersection is nonempty and whose total weight is maximum. AnO (n 2) algorithm is presented for the maximum clique problem. The algorithm is better than a previously known algorithm which is based on sorting and runs inO (n 2 logn) time.
Zusammenfassung
Diese Arbeit untersucht das folgende Optimierungsproblem: gegeben sei eine Menge von PunktenP i ,i=1,2, ...,n, in der Ebene, jeder mit Gewichtw i , und eine Kreisscheibe mit vorgegebenem Radius; finde eine Plazierung der Kreisscheibe, die die Summe der Gewichte aller überdeckten Punkte maximiert. Dieses Problem ist äquivalent zum folgenden Problem definiert für den Schnittgraphen vonn kongruenten gewichteten Kreisscheiben in der Ebene: bestimme eine Clique (die korrespondierenden Kreisscheiben haben einen nichtleeren gemeinsamen Durchschnitt), die die Summe der Gewichte maximiert. Wir präsentieren einenO (n 2)-Algorithmus für dieses Problem, was eine Verbesserung darstellt gegenüber dem besten bisher bekannten Algorithmus, der sortiert undO (n 2 logn) an Laufzeit benötigt.
Similar content being viewed by others
References
Bajaj, C., Li, M.: On the duality of intersection and closest points. Proc. 21st Annual Allerton Conference on Comm., Control and Computing, Monticello, IL, 459–460 (1983).
Bentley, J. L., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28, 643–647 (1979).
Chazelle, B. M., Guibas, L., J., Lee, D. T.: The power of geometric duality. Proc. IEEE 24th Symp. Foundations of Comput. Sci., Nov. 1983, pp. 217–225. To appear in BIT.
Drezner, Z.: On a modified one-center model. Management Sci.27, 838–851 (1981).
Edelsbrunner, H., O'Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. Proc. IEEE 24th Symp. Foundations of Comput. Sci., Nov. 1983, pp. 83–91. To appear in SIAM J. Comput.
Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algo.4,4 310–323 (1983).
Lee, D. T.: Maximum clique problem of rectangle graphs. In: Advances in Computing Research, Vol. 1, pp. 91–107 (F. P. Preparata, ed.). JAI Press Inc., 1983.
Muller, D. E., Preparata, F. P.: Finding the intersection of two convex polyhedra. Theoret. Comput. Sci.7 217–236 (1978).
Preparata, F. P., Shamos, M. I.: Computational Geometry. Berlin-Heidelberg-New York: Springer-Verlag 1985.
Author information
Authors and Affiliations
Additional information
Supported in part by the National Science Foundation under Grants MCS 8303925, MCS 8342682 and ECS 8340031, and ONR & DARPA under contract N00014-83-K-0146 and ARPA Order No. 4786. A preliminary version was presented at the 18th Annual Conference on Information Sciences and Systems, March 1984, Princeton, N. J.
Rights and permissions
About this article
Cite this article
Chazelle, B.M., Lee, D.T. On a circle placement problem. Computing 36, 1–16 (1986). https://doi.org/10.1007/BF02238188
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02238188