Pages that link to "Item:Q1305861"
From MaRDI portal
The following pages link to Rotational polygon containment and minimum enclosure using only robust 2D constructions (Q1305861):
Displayed 15 items.
- Phi-functions for 2D objects formed by line segments and circular arcs (Q447557) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
- Iterated snap rounding (Q1862124) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← links)
- 3D mesh cutting for high quality atlas packing (Q2100027) (← links)
- Robust atlas generation via angle-based segmentation (Q2180630) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Bundling Two Simple Polygons to Minimize Their Convex Hull (Q2980899) (← links)
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES (Q3442765) (← links)
- Two-dimensional profile-packing approach for multi-torch flame cutting (Q3605412) (← links)
- TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS (Q4931734) (← links)