The following pages link to (Q3507774):
Displaying 10 items.
- Covering a polygonal region by rectangles (Q538294) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- How many diagonal rectangles are needed to cover an orthogonal polygon? (Q1577551) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- A rectangular cover problem (Q2754537) (← links)
- On covering \(\mathbb Z\)-grid points by rectangles (Q2816037) (← links)
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles (Q3031946) (← links)
- Experimental and Efficient Algorithms (Q5710072) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901275) (← links)