An improved method for calculating the no-fit polygon

DOI10.1016/J.COR.2004.11.005MaRDI QIDQ2581595zbMATH OpenOpenAlexFDO

Authors Hamish T. Dean, Yiliu Tu, John F. Raffensperger

Publication date 10 January 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.11.005

zbMATH Keywords

Minkowski sumTwo-dimensional packingNo-fit polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The irregular nesting problem: a new approach for nofit polygon calculation
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Irregular packing using the line and arc no-fit polygon
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums

Cites work

• An algebra of polygons through the notion of negative shapes
• Computational Geometry in C
• Finding the upper envelope of n line segments in O(n log n) time
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.

Cited in

(6)

• Improving fitting quality of polygonal approximation by using the dynamic programming technique
• The irregular nesting problem: a new approach for nofit polygon calculation
• Solving the irregular strip packing problem via guided local search for overlap minimization
• A 2D convex shapes bin packing problem in the production of laminated safety glass
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.

This page was built for publication: An improved method for calculating the no-fit polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581595)