Advertisement
Published in:
01-08-2016
Optimal space coverage with white convex polygons
Published in: Journal of Combinatorial Optimization | Issue 2/2016
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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}\). (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}\).