Pages that link to "Item:Q707337"
From MaRDI portal
The following pages link to An optimal algorithm for one-separation of a set of isothetic polygons (Q707337):
Displaying 4 items.
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- On movable separability and isotheticity (Q1187211) (← links)
- Separating translates in the plane: Combinatorial bounds and an algorithm (Q5056170) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)