The irregular nesting problem: a new approach for nofit polygon calculation
From MaRDI portal
Recommendations
- A fully general, exact algorithm for nesting irregular shapes
- A customized branch-and-bound approach for irregular shape nesting
- An improved method for calculating the no-fit polygon
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Solving nesting problems with non-convex polygons by constraint logic programming
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- An optimal algorithm for computing a minimum nested nonconvex polygon
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A unifying approach for a class of problems in the computational geometry of polygons
Cited in
(6)- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- An improved method for calculating the no-fit polygon
- Irregular packing using the line and arc no-fit polygon
- The irregular nesting problem involving triangles and rectangles
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
This page was built for publication: The irregular nesting problem: a new approach for nofit polygon calculation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429840)