IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i23p3056-d689991.html
   My bibliography  Save this article

Efficient Covering of Thin Convex Domains Using Congruent Discs

Author

Listed:
  • Shai Gul

    (Department of Applied Mathematics, Holon Institute of Technology, Holon 5810201, Israel)

  • Reuven Cohen

    (Department of Mathematics, Bar-Ilan University, Ramat-Gan 5290002, Israel)

Abstract

We present efficient strategies for covering classes of thin domains in the plane using unit discs. We start with efficient covering of narrow domains using a single row of covering discs. We then move to efficient covering of general rectangles by discs centered at the lattice points of an irregular hexagonal lattice. This optimization uses a lattice that leads to a covering using a small number of discs. We compare the bounds on the covering using the presented strategies to the bounds obtained from the standard honeycomb covering, which is asymptotically optimal for fat domains, and show the improvement for thin domains.

Suggested Citation

  • Shai Gul & Reuven Cohen, 2021. "Efficient Covering of Thin Convex Domains Using Congruent Discs," Mathematics, MDPI, vol. 9(23), pages 1-10, November.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:23:p:3056-:d:689991
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/23/3056/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/23/3056/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ryu, Joonghyun & Lee, Mokwon & Kim, Donguk & Kallrath, Josef & Sugihara, Kokichi & Kim, Deok-Soo, 2020. "VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Árpád Bűrmen & Tadej Tuma, 2022. "Preface to the Special Issue on “Optimization Theory and Applications”," Mathematics, MDPI, vol. 10(24), pages 1-3, December.
    2. Ariel Fuxman & Shai Gul, 2022. "Existence and Uniqueness of a Curve with Both Minimal Length and Minimal Area," Mathematics, MDPI, vol. 10(21), pages 1-18, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Josef Kallrath & Joonghyun Ryu & Chanyoung Song & Mokwon Lee & Deok-Soo Kim, 2021. "Near optimal minimal convex hulls of disks," Journal of Global Optimization, Springer, vol. 80(3), pages 551-594, July.
    2. Hu, Zhi-Hua & Zheng, Yu-Xin & Wang, You-Gan, 2022. "Packing computing servers into the vessel of an underwater data center considering cooling efficiency," Applied Energy, Elsevier, vol. 314(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:23:p:3056-:d:689991. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.