Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks

References

• [1] Anderson A, Reznikov A, Vlasiuk O, White E (2022) Polarization and covering on sets of low smoothness. Adv. Math. 410(A):108720.Crossref, Google Scholar
• [2] Andreani R, Birgin EG, Martínez JM, Schuverdt ML (2008) Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Programming 111(1–2):5–32.Crossref, Google Scholar
• [3] Andreani R, Birgin EG, Martínez JM, Schuverdt ML (2008) On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18(4):1286–1309.Crossref, Google Scholar
• [4] Bambah RP (1954) On lattice coverings by spheres. Proc. Natl. Inst. Sci. India 20:25–52.Google Scholar
• [5] Bambah RP, Rogers CA (1952) Covering the planes with convex sets. J. London Math. Soc. 27:304–314.Crossref, Google Scholar
• [6] Bambah RP, Woods AC (1971) On plane coverings with convex domains. Mathematika 18(1):91–97.Crossref, Google Scholar
• [7] Bánhelyi B, Palatinus E, Lévai BL (2015) Optimal circle covering problems and their applications. Central Eur. J. Oper. Res. 23(4):815–832.Crossref, Google Scholar
• [8] Betke U, Henk M, Wills JM (1995) A new approach to covering. Mathematika 42(2):251–263.Crossref, Google Scholar
• [9] Birgin EG, Gentil JM (2010) New and improved results for packing identical unitary radius circles within triangles. Comput. Oper. Res. 37(7):1318–1327.Crossref, Google Scholar
• [10] Birgin EG, Martínez JM (2014) Practical Augmented Lagrangian Methods for Constrained Optimization (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [11] Birgin EG, Martínez JM (2020) Complexity and performance of an augmented Lagrangian algorithm. Optim. Methods Software 35(5):885–920.Crossref, Google Scholar
• [12] Birgin EG, Laurain A, Massambone R, Santana AG (2021) A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM J. Sci. Comput. 43(3):A2047–A2078.Crossref, Google Scholar
• [13] Birgin EG, Laurain A, Massambone R, Santana AG (2022) A shape-Newton approach to the problem of covering with identical balls. SIAM J. Sci. Comput. 44(2):A798–A824.Crossref, Google Scholar
• [14] Birgin EG, Gómez W, Haeser G, Mito LM, Viana DS (2020) An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Comput. Appl. Math. 39(1):10.Crossref, Google Scholar
• [15] Böröczky K Jr (2004) Finite Packing and Covering (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [16] Cafieri S, Hansen P, Messine F (2022) Global exact optimization for covering a rectangle with circles. J. Global Optim. 83:163–185.Crossref, Google Scholar
• [17] Conway JH, Sloane NJA (1999) Sphere Packings, Lattices and Groups, 3rd ed. (Springer-Verlag, New York).Crossref, Google Scholar
• [18] Das GK, Das S, Nandy SC, Sinha BP (2006) Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. 66(11):1353–1358.Crossref, Google Scholar
• [19] Delfour MC, Zolésio JP (2011) Shapes and Geometries: Metrics, Analysis, Differential Calculus, and Optimization, 2nd ed. (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [20] Fáry I (1950) Sur la densité des réseaux de domaines convexes. Bull. Soc. Math. France 78:152–161.Crossref, Google Scholar
• [21] Fejes-Tóth L (1948) Eine bemerkung über die bedeckung der ebene durch eibereiche mit mittelpunkt. Acta Scientiarum Mathematicarum 11(1–2):93–95.Google Scholar
• [22] Galiev SI, Karpova MA (2010) Optimization of multiple covering of a bounded set with circles. Comput. Math. Math. Phys. 50(4):721–732.Crossref, Google Scholar
• [23] Glazyrin A (2019) Covering a ball by smaller balls. Discrete Comput. Geometry 62(4):781–787.Crossref, Google Scholar
• [24] Graf S, Luschgy H (2000) Foundations of Quantization for Probability Distributions, Lecture Notes in Mathematics, vol. 1730 (Springer-Verlag, Berlin).Crossref, Google Scholar
• [25] Gray A (2004) Tubes, 2nd ed. (Springer Basel AG, Basel, Switzerland).Crossref, Google Scholar
• [26] Henrot A, Pierre M (2018) Shape Variation and Optimization (European Mathematical Society, Zürich).Crossref, Google Scholar
• [27] Kershner R (1939) The number of circles covering a set. Amer. J. Math. 61(3):665–671.Crossref, Google Scholar
• [28] Kolmogorov AN, Tikhomirov VM (1959) ε-entropy and ε-capacity of sets in function spaces. Uspehi Mat. Nauk 14(2 (86)):3–86.Google Scholar
• [29] Laurain A (2020) Distributed and boundary expressions of first and second order shape derivatives in nonsmooth domains. J. Math. Pures Appl. 134:328–368.Crossref, Google Scholar
• [30] Laurain A, Sturm K (2016) Distributed shape derivative via averaged adjoint method and applications. ESAIM: Math. Model. Numerical Anal. 50(4):1241–1267.Crossref, Google Scholar
• [31] Melissen H (1997) Loosest circle coverings of an equilateral triangle. Math. Magazine 70(2):118–124.Crossref, Google Scholar
• [32] Melissen JBM, Schuur PC (1996) Improved coverings of a square with six and eight equal circles. Electronic J. Combin. 3:R32.Crossref, Google Scholar
• [33] Melissen JBM, Schuur PC (2000) Covering a rectangle with six and seven circles. Discrete Appl. Math. 99(1–3):149–156.Crossref, Google Scholar
• [34] Neville EH (1915) On the solution of numerical functional equations: Illustrated by an account of a popular puzzle and of its solution. Proc. London Math. Soc. s2-14(1):308–326.Crossref, Google Scholar
• [35] Nurmela KJ (2000) Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experiment. Math. 9(2):241–250.Crossref, Google Scholar
• [36] Nurmela KJ, Östergärd PRJ (2000) Covering a square with up to 30 equal circles. Technical Report HUT-TCS-A62, Helsinki University of Technology.Google Scholar
• [37] Sokolowski J, Zolesio JP (1992) Introduction to shape optimization. Introduction to Shape Optimization: Shape Sensitivity Analysis (Springer, Berlin, Heidelberg), 5–12.Crossref, Google Scholar
• [38] Stoyan YG, Patsuk VM (2010) Covering a compact polygonal set by identical circles. Comput. Optim. Appl. 46(1):75–92.Crossref, Google Scholar
• [39] Sutherland IE, Hodgman GW (1974) Reentrant polygon clipping. Assoc. Comput. Machinery 17(1):32–42.Crossref, Google Scholar
• [40] Tarnai T, Gáspár Z (1995) Covering a square by equal circles. Elemente der Mathematik 50(4):167–170.Google Scholar
• [41] Verblunsky S (1949) On the least number of unit circles which can cover a square. J. London Math. Soc. s1-24(3):164–170.Crossref, Google Scholar
• [42] Verger-Gaugry JL (2005) Covering a ball with smaller equal balls in Rn. Discrete Comput. Geometry 33(1):143–155.Crossref, Google Scholar
• [43] Zahn ZT Jr (1962) Black box maximization of circular coverage. J. Res. Natl. Bureau Standards B Math. Math. Phys. 66B(4):181–216.Crossref, Google Scholar
• [44] Zong C (2014) Packing, covering and tiling in two-dimensional spaces. Expositiones Mathematicae 32(4):297–364.Crossref, Google Scholar