Abstract
We study the efficient approximation algorithm for max-covering circle problem. Given a set of weighted points in the plane and a circle with specified size, max-covering circle problem is to find the proper place where the center of the circle is located so that the total weight of the points covered by the circle is maximized. Our core approach is to approximate the circle with a symmetrical rectilinear polygon (SRP). We first present a method to construct the circumscribed SRP of a given circle and disclose their area relationship. Then, we convert max-covering SRP problem to SRP intersection problem, which can be efficiently solved with simple partition and modification based on the existing method. Finally, the optimal solution returned from max-covering SRP problem can be used to produce an approximate answer to max-covering circle problem. We prove that for most of the inputs, our algorithm can give a \(\left( 1-\varepsilon \right) \) approximation to the optimal solution, which only needs \(O\left( n\varepsilon ^{-1}\mathrm{{log}}\,n+n\varepsilon ^{-1}\log \left( \frac{1}{\varepsilon }\right) \right) \) time for unit points and \(o \left( n\varepsilon ^{-2}\,\mathrm{{log}}\,n \right) \) time for weighted points.
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
Similar content being viewed by others
References
Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38–56 (1991)
Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899–921 (2008)
Chan, T.M., Har-Peled, S.: Smallest k-enclosing rectangle revisited. Discrete Comput. Geomet. 66(2), 769–791 (2021)
Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing 36(1), 1–16 (1986)
Choi, D., Chung, C., Tao, Y.: A scalable algorithm for maximizing range sum in spatial databases. Proc. VLDB Endow 5(11), 1088–1099 (2012)
Datta, A., Lenhof, H.P., Schwarz, C., Smid, M.: Static and dynamic algorithms for k-point clustering problems. J. Algorithms 19(3), 474–503 (1995)
De Berg, M., Cabello, S., Cheong, O., Eppstein, D., Knauer, C.: Covering many points with a small-area box. arXiv preprint arXiv:1612.02149 (2016)
De Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory Comput. Syst. 45(3) (2009)
Efrat, A., Sharir, M., Ziv, A.: Computing the smallest k-enclosing circle and related problems. Comput. Geom. 4(3), 119–136 (1994)
Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geomet. 11(3), 321–350 (1994)
Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica 41(3), 147–157 (2005)
Hemmer, M., Kleinbort, M., Halperin, D.: Improved implementation of point location in general two-dimensional subdivisions. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 611–623. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_53
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13–30 (1963)
Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310–323 (1983)
Kaplan, H., Roy, S., Sharir, M.: Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81, 1–11 (2019)
Mahapatra, P.R.S., Karmakar, A., Das, S., Goswami, P.P.: k-enclosing axis-parallel square. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011. LNCS, vol. 6784, pp. 84–93. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21931-3_7
Matoušek, J.: On enclosing k points by a circle. Inf. Process. Lett. 53(4), 217–221 (1995)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Comput. Math. Appl. 29(8), 45–61 (1995)
Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985). https://doi.org/10.1007/978-1-4612-1098-6
Tao, Y., Hu, X., Choi, D., Chung, C.: Approximate Maxrs in spatial databases. Proc. VLDB Endow 6(13), 1546–1557 (2013)
Zhang, K., Gao, H., Han, X., Chen, J., Li, J.: Maximizing range sum in trajectory data. In: IEEE International Conference on Data Engineering, pp. 755–766 (2022)
Acknowledgements
This work was supported by NSFC grant (Nos. 62102119, U19A2059, U22A2025 and 62232005).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, K., Zhang, S., Gao, J., Wang, H., Gao, H., Li, J. (2024). A Novel Approximation Algorithm for Max-Covering Circle Problem. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14461. Springer, Cham. https://doi.org/10.1007/978-3-031-49611-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-49611-0_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49610-3
Online ISBN: 978-3-031-49611-0
eBook Packages: Computer ScienceComputer Science (R0)