Pages that link to "Item:Q3712146"
From MaRDI portal
The following pages link to Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition (Q3712146):
Displayed 14 items.
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- A polynomial solution for the Potato-peeling problem (Q1076347) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Stock cutting to minimize cutting length (Q1266563) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- Minimum area circumscribing polygons (Q1822239) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- New approaches for the nesting of two-dimensional shapes for press tool design (Q3356038) (← links)
- Finding minimal enclosing boxes (Q3704926) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
- An object-based evolutionary algorithm for solving nesting problems (Q5444463) (← links)
