Pages that link to "Item:Q1127205"
From MaRDI portal
The following pages link to A new algorithm for the minimal-area convex enclosure problem (Q1127205):
Displaying 9 items.
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- New area-minimizing Lawson-Osserman cones (Q1644977) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← links)
- (Q3123572) (← links)
- (Q4763392) (← links)
- An object-based evolutionary algorithm for solving nesting problems (Q5444463) (← links)