The following pages link to Finding minimum area \(k\)-gons (Q1186081):
Displayed 9 items.
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- Finding minimum area simple pentagons (Q1267196) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Smallest nonparametric tolerance regions. (Q1848908) (← links)