Covering a polygonal region by rectangles
From MaRDI portal
Publication:538294
DOI10.1007/S10589-009-9258-1zbMATH Open1219.90147OpenAlexW2132438290MaRDI QIDQ538294FDOQ538294
Authors: 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
Recommendations
Cites Work
Cited In (12)
- Lattice coverage of cuboid with minimum number of hemispheres
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- The concept of modeling packing and covering problems using modern computational geometry software
- Optimized packing multidimensional hyperspheres: a unified approach
- Phi-functions for 2D objects formed by line segments and circular arcs
- Mathematical model and efficient algorithms for object packing problem
- Packing ellipsoids into volume-minimizing rectangular boxes
- Packing resizable items with application to video delivery over wireless networks
- A translational rectangular covering
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- A rectangular cover problem
This page was built for publication: Covering a polygonal region by rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538294)