Pages that link to "Item:Q1970337"
From MaRDI portal
The following pages link to Close approximations of minimum rectangular coverings (Q1970337):
Displaying 8 items.
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Covering rectilinear polygons with axis-parallel rectangles (Q2819577) (← links)
- (Q3540322) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944) (← links)
- Experimental and Efficient Algorithms (Q5710072) (← links)