Abstract
The paper is devoted to the circle covering problem with unequal circles. The number of circles is given. Also, we know a function, which determines a relation between the radii of two neighboring circles. The circle covering problem is usually studied in the case when the distance between points is Euclidean. We assume that the distance is determined by means of some special metric, which, generally speaking, is not Euclidean. The special numerical algorithm is suggested and implemented. It based on optical-geometric approach, which is developed by the authors in recent years and previously used only for circles of the equal radius. The results of a computational experiment are presented and discussed.
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
References
Al-Sultan, K., Hussain, M., Nizami, J.: A genetic algorithm for the set covering problem. J. Oper. Res. Soc. 47(5), 702–709 (1996)
Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290–300 (2010)
Bánhelyi, B., Palatinus, E., Lévai, B.: Optimal circle covering problems and their applications. CEJOR 23(4), 815–832 (2015)
Borovskikh, A.: The two-dimensional eikonal equation. Siberian Math. J. 47(2), 813–834 (2006)
Brusov, V., Piyavskii, S.: A computational algorithm for optimally covering a plane region. USSR Comput. Math. Math. Phys. 11(2), 17–27 (1971)
Conway, J., Sloane, N.: Sphere Packing. Lattices and Groups. Springer Science and Business Media, New York (1999)
Dorninger, D.: Thinnest covering of the euclidean plane with incongruent circles. Anal. Geom. Metr. Spaces 5(1), 40–46 (2017)
Florian, A., Heppes, A.: Solid coverings of the euclidean plane with incongruent circles. Discrete Comput. Geom. 23(2), 225–245 (2000)
Fodor, F.: The densest packing of 19 congruent circles in a circle. Geom. Dedicata. 74(2), 139–145 (1999)
Fodor, F.: The densest packing of 12 congruent circles in a circle. Beitr. Algebra Geom. 41(2), 401–409 (2000)
Fodor, F.: The densest packing of 13 congruent circles in a circle. Contrib. Algebra Geom. 44(2), 431–440 (2003)
Friedman, E.: Circles covering squares. http://www2.stetson.edu/~efriedma/circovsqu/. Accessed 7 Feb 2019
Heppes, A., Melissen, J.: Covering a rectangle with equal circles. Periodica Math. Hung. 34, 65–81 (1997)
Heppes, A., Melissen, J.: Covering a rectangle with equal circles. Periodica Math. Hung. 34(1–2), 65–81 (1997)
Jandl, H., Wieder, A.: A continuous set covering problem as a quasi differentiale optimization problem. Optim. J. Math. Program. Oper. Res. 19(6), 781–802 (1988)
Kazakov, A., Lempert, A.: An approach to optimization in transport logistics. Autom. Remote Control 72(7), 1398–1404 (2011)
Kazakov, A., Lempert, A.: On mathematical models for optimization problem of logistics infrastructure. Int. J. Artif. Intell. 13(1), 200–210 (2015)
Kazakov, A., Lempert, A., Le, Q.: An algorithm for packing circles of two types in a fixed size container with non-euclidean metric. In: Supplementary Proceedings of the Sixth International Conference on Analysis of Images, Social Networks and Texts, vol. 1975, pp. 281–292. CEUR-WS (2017)
Kirchner, K., Wengerodt, G.: Die dichteste packung von 36 kreisen in einem quadrat. Beitr. Algebra Geom. 25, 147–159 (1987)
Markot, M.: Interval methods for verifying structural optimality of circle packing configurations in the unit square. J. Comput. Appl. Math. 199, 353–357 (2007)
Melissen, J.: Densest packings of eleven congruent circles in a circle. Geom. Dedicata. 50, 15–25 (1994)
Melissen, J., Schuur, P.: Covering a rectangle with six and seven circles. Discrete Appl. Math. 99, 149–156 (2000)
Nurmela, K.: Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Exp. Math. 9(2), 241–250 (2000)
Nurmela, K., Ostergard, P.: Packing up to 50 circles in a square. Discrete Comput. Geom. 18, 111–120 (1997)
Nurmela, K., Ostergard, P.: Covering a square with up to 30 equal circles. Technical report Res. rept A62., Lab. Technol. Helsinki Univ. (2000)
Stoyan, Y., Patsuk, V.: Covering a compact polygonal set by identical circles. Comput. Optim. Appl. 46, 75–92 (2010)
Tarnai, T., Gaspar, Z.: Covering a square by equal circles. Elem. Math. 50, 167–170 (1995)
Toth, G.: Covering the plane with two kinds of circles. Discrete Comput. Geom. 13, 445–457 (1995)
Toth, G.: Thinnest covering of a circle by eight, nine, or ten congruent circles. Comb. Comput. Geom. 52, 361–376 (2005)
Toth, L.F.: Solid circle-packings and circle-coverings. Studia Sci. Math. Hungar. 3, 401–409 (1968)
Ushakov, V., Lebedev, P.: Algorithms of optimal set covering on the planar \({R^2}\). Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki 26(2), 258–270 (2016)
Watson-Gandy, C.D.T.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290–300 (2010)
Acknowledgements
This work was partially supported by the Russian Foundation for Basic Research, research project No. 18-08-00604.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kazakov, A., Lempert, A., Le, Q.M. (2019). On the Thinnest Covering of Fixed Size Containers with Non-euclidean Metric by Incongruent Circles. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-33394-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33393-5
Online ISBN: 978-3-030-33394-2
eBook Packages: Computer ScienceComputer Science (R0)