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}\).
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-014-9822-1/MediaObjects/10878_2014_9822_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-014-9822-1/MediaObjects/10878_2014_9822_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-014-9822-1/MediaObjects/10878_2014_9822_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-014-9822-1/MediaObjects/10878_2014_9822_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-014-9822-1/MediaObjects/10878_2014_9822_Fig5_HTML.gif)
Similar content being viewed by others
References
Agarwal PK, Mustafa NH (2006) Independent set of intersection graphs of convex objects in 2d. Comp Geom 34(2):83–95
De Castro N, Cobos FJ, Dana JC, Marquez A, Noy M (2002) Triangle-free planar graphs as segment intersection graphs. J Graph Algorithms Appl 6(1):7–26
Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51(1):161–166
Ehsani S, Fazli MA, Ghodsi M, Safari MA, Saghafian M, Tavakkoli M (2011) White space regions. In: Cerna I, Gyimothy T (eds) SOFSEM 2011: Theory and practice of computer science. Springer, Berlin, pp 226–237
Fischer P (1993) Finding maximum convex polygons. In: Esik Z (ed) Fundamentals of computation theory. Springer, Berlin, pp 234–243
Madhavan C (1984) Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Joseph M, Shyamasundar R (eds) Foundations of software technology and theoretical computer science. Springer, Berlin, pp 381–392
Sas E (1941) On a certain extremum-property of the ellipse. Mat Fiz Lapok 48:533–542
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ehsani, S., Fazli, M., Ghodsi, M. et al. Optimal space coverage with white convex polygons. J Comb Optim 32, 341–353 (2016). https://doi.org/10.1007/s10878-014-9822-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9822-1