Abstract
Let P be a weighted set of points in the plane. In this paper we study the problem of computing a circle of smallest radius such that the total weight of the points covered by the circle is maximized. We present an algorithm with polynomial time depending on the number of points with positive and negative weight. We also consider a restricted version of the problem where the center of the circle should be on a given line and give an algorithm that runs in \(O(n(m+n) \log (m+n))\) time using \(O(m+n)\) space. The algorithm can report all k smallest maximal weight circles with an additional O(k) space. Moreover, for this version, if all positively weighted points are required to be included within the circle then we prove a number of interesting properties and provide an algorithm that runs in \(O((n+m) \log (n+m))\) time.
Daescu’s research is partially supported by NSF award IIP1439718 and CPRIT award RP150164.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbay, J., Chan, T.M., Navarro, G., Pérez-Lantero, P.: Maximum-weight planar boxes in \(O(n^2)\) time (and better). Inf. Process. Lett. 114(8), 437–445 (2014)
Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 345–353 (2000)
Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380–385 (2015)
Bitner, S., Cheung, Y.K., Daescu, O.: Minimum separating circle for bichromatic points in the plane. In: Proceedings of the 7th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 50–55 (2010)
Cheung, Y.K., Daescu, O., Zivanic, M.: Kinetic red-blue minimum separating circle. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 448–463. Springer, Heidelberg (2011)
Dobkin, D.P., Eppstein, D., Mitchell, D.P.: Computing the discrepancy with applications to supersampling patterns. ACM Transactions on Graphics 15, 354–376 (1996)
Har-Peled, S., Lee, M.: Weighted geometric set cover problems revisited. Journal of Computational Geometry 3(1), 65–85 (2012)
Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica 41(3), 147–157 (2005)
O’Rourke, J., Kosaraju, S., Megiddo, N.: Computing circular separability. Discrete. Computational Geometry 1, 105–113 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bereg, S., Daescu, O., Zivanic, M., Rozario, T. (2015). Smallest Maximum-Weight Circle for Weighted Points in the Plane. In: Gervasi, O., et al. Computational Science and Its Applications -- ICCSA 2015. ICCSA 2015. Lecture Notes in Computer Science(), vol 9156. Springer, Cham. https://doi.org/10.1007/978-3-319-21407-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-21407-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21406-1
Online ISBN: 978-3-319-21407-8
eBook Packages: Computer ScienceComputer Science (R0)