IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i2d10.1007_s10878-014-9822-1.html
   My bibliography  Save this article

Optimal space coverage with white convex polygons

Author

Listed:
  • Shayan Ehsani

    (Stanford University)

  • MohammadAmin Fazli

    (Sharif University of Technology)

  • Mohammad Ghodsi

    (Sharif University of Technology
    Institute of Research in Fundamental Sciences (IPM))

  • MohammadAli Safari

    (Sharif University of Technology)

Abstract

Assume that we are given a set of points some of which are black and the rest are white. The goal is to find a set of convex polygons with maximum total area that cover all white points and exclude all black points. We study the problem on three different settings (based on overlapping between different convex polygons): (1) In case convex polygons are permitted to have common area, we present a polynomial algorithm. (2) In case convex polygons are not allowed to have common area but are allowed to have common vertices, we prove the NP-hardness of the problem and propose an algorithm whose output is at least $$\left( \frac{OPT}{log(2n/OPT) + 2log(n)}\right) ^{1/4}$$ O P T l o g ( 2 n / O P T ) + 2 l o g ( n ) 1 / 4 . (3) Finally, in case convex polygons are not allowed to have common area or common vertices, also we prove the NP-hardness of the problem and propose an algorithm whose output is at least $$\frac{3\sqrt{3}}{4.\pi }\left( \frac{OPT}{log(2n/OPT) + 2log(n)}\right) ^{1/4}$$ 3 3 4 . π O P T l o g ( 2 n / O P T ) + 2 l o g ( n ) 1 / 4 .

Suggested Citation

  • Shayan Ehsani & MohammadAmin Fazli & Mohammad Ghodsi & MohammadAli Safari, 2016. "Optimal space coverage with white convex polygons," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 341-353, August.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-014-9822-1
    DOI: 10.1007/s10878-014-9822-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9822-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9822-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-014-9822-1. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.