Optimal space coverage with white convex polygons

DOI10.1007/S10878-014-9822-1MaRDI QIDQ306074zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmNP-hardnessconvex coveringwhite convex polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 3881891 (Why is no real title available?)
• scientific article; zbMATH DE number 522850 (Why is no real title available?)
• scientific article; zbMATH DE number 3041934 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• Independent set of intersection graphs of convex objects in 2D
• Triangle-Free Planar Graphs and Segment Intersection Graphs
• White space regions

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)