Pages that link to "Item:Q3826568"

The following pages link to Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles (Q3826568):

Displayed 2 items.

• Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) ‎ (← links)
• Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) ‎ (← links)