Optimal space coverage with white convex polygons

DOI10.1007/S10878-014-9822-1zbMATH Open1354.90107OpenAlexW2036733906MaRDI QIDQ306074FDOQ306074

Authors: Shayan Ehsani, Mohammad Ghodsi, MohammadAmin Fazli, MohammadAli Safari 

Publication date: 31 August 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9822-1

Recommendations

• Covering points with minimum/maximum area orthogonally convex polygons
• Covering Polygons Is Hard
• Computing optimal islands
• scientific article; zbMATH DE number 522850
• scientific article; zbMATH DE number 871906

zbMATH Keywords

algorithmNP-hardnessconvex coveringwhite convex polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Triangle-Free Planar Graphs and Segment Intersection Graphs
• A decomposition theorem for partially ordered sets
• Independent set of intersection graphs of convex objects in 2D
• White space regions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• White space regions

This page was built for publication: Optimal space coverage with white convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306074)