Pages that link to "Item:Q1102107"
From MaRDI portal
The following pages link to Algorithms for minimum length partitions of polygons (Q1102107):
Displaying 7 items.
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- Computing optimal diameter-bounded polygon partitions (Q1882473) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- (Q4763392) (← links)