Pages that link to "Item:Q4274652"
From MaRDI portal
The following pages link to The complexity of computing minimum separating polygons (Q4274652):
Displayed 5 items.
- Geometric Knapsack problems (Q689105) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- (Q5116471) (← links)