The following pages link to Finding minimal nested polygons (Q802901):
Displaying 9 items.
- Polygon nesting and robustness (Q917303) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- An approximate algorithm for the minimal vertex nested polygon problem (Q1812727) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Finding the smallest triangles containing a given convex polygon (Q3697817) (← links)
