A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
DOI10.1016/J.COR.2006.02.026zbMATH Open1136.65023OpenAlexW1993091251MaRDI QIDQ2384604FDOQ2384604
Authors: Julia A. Bennell, X. 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
Recommendations
- An improved method for calculating the no-fit polygon
- scientific article; zbMATH DE number 1670643
- Polygon decomposition for efficient construction of Minkowski sums
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- The irregular nesting problem: a new approach for nofit polygon calculation
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- scientific article; zbMATH DE number 1728309
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mixed volumes and related topics in convex geometry (52A39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Compaction and separation algorithms for non-convex polygons and their applications
- 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
- An optimal algorithm for intersecting line segments in the plane
- Computational Geometry in C
- Title not available (Why is that?)
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- Polygon decomposition for efficient construction of Minkowski sums
- An algebra of polygons through the notion of negative shapes
- Title not available (Why is that?)
Cited In (18)
- Irregular packing: MILP model based on a polygonal enclosure
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- Tools of mathematical modeling of arbitrary object packing problems
- The irregular nesting problem: a new approach for nofit polygon calculation
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A beam search implementation for the irregular shape packing problem
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Irregular packing problems: a review of mathematical models
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- Algorithms for nesting with defects
- An improved method for calculating the no-fit polygon
- Irregular stock cutting system based on AutoCAD
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
This page was built for publication: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384604)
