A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums

DOI10.1016/j.cor.2006.02.026zbMath1136.65023OpenAlexW1993091251MaRDI QIDQ2384604

Julia A. Bennell, Xiang Song

Publication date: 10 October 2007

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

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

zbMATH Keywords

configuration spacegeometric algorithmsnestingno-fit polygonCutting and packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mixed volumes and related topics in convex geometry (52A39)

Related Items (13)

The geometry of nesting problems: a tutorial ⋮ Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers ⋮ Tools of mathematical modeling of arbitrary object packing problems ⋮ Algorithms for nesting with defects ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Irregular stock cutting system based on AutoCAD ⋮ Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues ⋮ A beam search implementation for the irregular shape packing problem ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Irregular packing problems: a review of mathematical models ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Irregular packing: MILP model based on a polygonal enclosure

Cites Work

• Unnamed Item
• Unnamed Item
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Compaction and separation algorithms for non-convex polygons and their applications
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• An algebra of polygons through the notion of negative shapes
• Computational Geometry in C
• An optimal algorithm for intersecting line segments in the plane
• Polygon decomposition for efficient construction of Minkowski sums

This page was built for publication: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums