Pages that link to "Item:Q3986399"
From MaRDI portal
The following pages link to COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME (Q3986399):
Displaying 5 items.
- Covering convex sets with non-overlapping polygons (Q912393) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- A linear-time construction of Reuleaux polygons (Q2365262) (← links)
- Covering rectilinear polygons with axis-parallel rectangles (Q2819577) (← links)
- A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944) (← links)