Covering a polygonal region by rectangles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- scientific article; zbMATH DE number 5025945 (Why is no real title available?)
- Optimal packing and covering in the plane are NP-complete
- Packing of convex polytopes into a parallelepiped
- Tools of mathematical modeling of arbitrary object packing problems
- \(\Phi\)-functions for complex 2D-objects
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
- Optimized packing multidimensional hyperspheres: a unified approach
- 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
- 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)
