Complete and robust no-fit polygon generation for the irregular stock cutting problem
type: Item
instance of: scholarly article
title: Complete and robust no-fit polygon generation for the irregular stock cutting problem
zbMATH Open document ID: 1175.90325
author: R. S. R. Hellier
author: Glenn Whitwell
author: Edmund K. Burke
author: Graham Kendall
published in: European Journal of Operational Research
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 52A39
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5082818
zbMATH Keywords: cutting
zbMATH Keywords: packing
zbMATH Keywords: no-fit polygon
zbMATH Keywords: orbital approach
describes a project that uses: TOPOS
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.03.011
OpenAlex ID: W1977402971
cites work: Polygon decomposition for efficient construction of Minkowski sums
cites work: Q3837777
cites work: Q3787492
cites work: The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
cites work: Q3750120
cites work: Packing problems
cites work: Jostling for position: local improvement for irregular cutting patterns
cites work: An algorithm for polygon placement using a bottom-left strategy
cites work: A typology of cutting and packing problems
cites work: Q4198056
cites work: An algebra of polygons through the notion of negative shapes
cites work: A 2-exchange heuristic for nesting problems
cites work: A new algorithm for the minimal-area convex enclosure problem
cites work: Q3670558
cites work: Compaction and separation algorithms for non-convex polygons and their applications
cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions
cites work: Computational Geometry in C
cites work: Modeling of packing problems
cites work: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
cites work: \(\Phi\)-functions for complex 2D-objects
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
DOI: 10.1016/J.EJOR.2006.03.011
Recommended article: The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
Recommended article: The irregular nesting problem: a new approach for nofit polygon calculation
Recommended article: On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Recommended article: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
Recommended article: A local search approach for two-dimensional irregular cutting
Recommended article: Generating Fenchel Cutting Planes for Knapsack Polyhedra
Recommended article: An approximation algorithm for cutting out convex polygons
Recommended article: Q4471377
Recommended article: Exact approaches for the unconstrained two-dimensional cutting problem with defects
description: scientific article; zbMATH DE number 5082818