The following pages link to Minimum-perimeter enclosures (Q963415):
Displaying 17 items.
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Sweeping an oval to a vanishing point (Q642967) (← links)
- Finding minimal nested polygons (Q802901) (← links)
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Smallest enclosing cylinders (Q1977135) (← links)
- Extremal convex polygons inscribed in a given convex polygon (Q2064020) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Computing nonsimple polygons of minimum perimeter (Q5745396) (← links)
