Pages that link to "Item:Q1886238"
From MaRDI portal
The following pages link to An approximation algorithm for cutting out convex polygons (Q1886238):
Displaying 13 items.
- Approximation algorithms for cutting a convex polyhedron out of a sphere (Q388101) (← links)
- Cutting a convex polyhedron out of a sphere (Q659695) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- A PTAS for cutting out polygons with lines (Q1014794) (← links)
- Stock cutting to minimize cutting length (Q1266563) (← links)
- The cost of cutting out convex \(n\)-gons (Q1887073) (← links)
- Cutting out polygon collections with a saw (Q2357165) (← links)
- Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere (Q3004662) (← links)
- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost (Q3404452) (← links)
- CUTTING OUT POLYGONS WITH A CIRCULAR SAW (Q3459357) (← links)
- (Q4455257) (← links)
- CUTTING OUT POLYGONS WITH LINES AND RAYS (Q5470174) (← links)
- Algorithms and Computation (Q5712155) (← links)