Covering polygons with rectangles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- Almost optimal set covers in finite VC-dimension
- Approximation schemes for covering and packing problems in image processing and VLSI
- Computational geometry. Algorithms and applications.
- Covering Polygons Is Hard
- Covering many or few points with unit disks
- Covering polygons with rectangles
- Covering rectilinear polygons with axis-parallel rectangles
- Experimental and Efficient Algorithms
- Improved approximation algorithms for geometric set cover
- Optimal packing and covering in the plane are NP-complete
- Optimal placement of convex polygons to maximize point containment
- Solution approaches to irregular nesting problems
Cited in
(10)- Covering polygons with rectangles
- Covering a rectangle with equal circles
- Periodic interlocking problems in \(\mathbb R\times[0,w]\)
- scientific article; zbMATH DE number 5291457 (Why is no real title available?)
- A rectangular cover problem
- Covering a convex polygon by triangles
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
- Covering of a rectangle with squares from both sides
- Covering a square by small perimeter rectangles
- scientific article; zbMATH DE number 29609 (Why is no real title available?)
This page was built for publication: Covering polygons with rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988828)
