Pages that link to "Item:Q4274652"
From MaRDI portal
The following pages link to The complexity of computing minimum separating polygons (Q4274652):
Displaying 13 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- (Q3217600) (← links)
- (Q4252379) (← links)
- (Q4530817) (← links)
- (Q5116471) (← links)
- (Q5325265) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)