Abstract
The paper considers the problem of covering compact polygonal set by identical circles of minimal radius. A mathematical model of the problem based on Voronoi polygons is constructed and its characteristics are investigated. On the ground of the characteristics a modification of the Zoutendijk feasible directions method is developed to search local minima. A special approach is suggested to choose starting points. Many computational examples are given.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Berge, Cl.: Topological Spaces. Oliver and Boyd, Edinburgh (1963)
Sloane, N.J.A.: with the collaboration of Hardin, R.H., Smith, W.D., et al.: Tables of spherical codes. http://www.research.att.com/~njas/packings/
Melissen, H.: Packing and covering with circles. PhD thesis, Universiteit Utrecht, the Netherlands (1997)
Zahn, C.T. Jr.: Black box maximization of circular coverage. J. Res. Nat. Bur. Stand. Sect. B 66, 181–216 (1962)
Tarnai, T., Gaspar, Zs.: Covering a square by equal circles. Elem. Math. 50, 167–170 (1995)
Rogers, C.A.: Packing and Covering. Cambridge University Press, Cambridge (1964)
Melissen, J.B.M., Schuur, P.C.: Improved coverings of a square with six and eight equal circles. Electron. J. Comb. 3(32R), 10 (1996) (electronic)
Lengyel, A., Veres, I.A.: Egységnégyzet lefedése egybevágó körökkel (Covering the unit square with congruent circles). Competition essay, Technical University Budapest, Hungary (1996)
Heppes, A., Melissen, H.: Covering a rectangle with equal circles. Period. Math. Hung. 34, 65–81 (1997)
Melissen, J.B.M., Schuur, P.C.: Covering a rectangle with six and seven circles. Discrete Appl. Math. 99, 149–156 (2000)
Melissen, H.: Loosest circle coverings of an equilateral triangle. Math. Mag. 70, 119–125 (1997)
Nurmela, K.J.: Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Exp. Math. 9(2), 241–250 (2000)
Melissen, H.: Packing and covering with circles. PhD thesis, Universiteit Utrecht, the Netherlands (1997)
Nurmela, K.J., Östergård, P.R.J.: Covering a square with up to 30 circles. Helsinki University of Technology, Laboratory for Theoretical Computer Science. Research report (2000)
Stoyan, Yu.G., Patsuk, V.M.: Covering a polygonal region with equal number of circles of a given radius. Reports Of the National Academy of Sciences of Ukraine, No. 3, pp. 74–77. Kiev (2006) (in Russian)
Patsuk, V., Stoyan, Yu.: Covering a convex polygon with the given number of equal circles of minimal radius. In: Proc. of the Workshop on Cutting Stock Problems 2005 (WSCSP2005), pp. 59–64. Sapientia University of Miercurea-Ciuc, Romania (2006)
Minkowski, H.: Dichteste gitterformige Lagerung. Nachr. Ges. Wiss., pp. 311–355. Gottingen (1904)
Rvatchev, V.L.: Theory of R-functions and Some Applications. Naukova Dumka, Kiev (1982) (in Russian)
Zoutendijk, G.: Methods of Feasible Directions: a Study in Linear and Non-Linear Programming. Elsevier, Amsterdam (1970)
Voronoi, G.F.: Collected Works, vol. II, pp. 171–368. Academy of Sciences of USSR, Kiev (1952)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stoyan, Y.G., Patsuk, V.M. Covering a compact polygonal set by identical circles. Comput Optim Appl 46, 75–92 (2010). https://doi.org/10.1007/s10589-008-9191-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-008-9191-8