Covering a polygonal region by rectangles

DOI10.1007/s10589-009-9258-1zbMath1219.90147OpenAlexW2132438290MaRDI QIDQ538294

Yong-Cai Geng, Sumit K. Garg

Publication date: 25 May 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9258-1

zbMATH Keywords

optimizationmathematical modelingcovering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Packing ellipsoids into volume-minimizing rectangular boxes ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Lattice coverage of cuboid with minimum number of hemispheres ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications

Cites Work

• Tools of mathematical modeling of arbitrary object packing problems
• Optimal packing and covering in the plane are NP-complete
• \(\Phi\)-functions for complex 2D-objects
• Packing of convex polytopes into a parallelepiped
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering a polygonal region by rectangles