Complete and robust no-fit polygon generation for the irregular stock cutting problem
Authors:
- E.K. BurkeEBE.K. Burke
- R.S.R. HellierRHR.S.R. Hellier
- G. KendallGKG. Kendall
- G. WhitwellGWG. Whitwell
- 1 May 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (1) , 27-49
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A 2-exchange heuristic for nesting problemsEuropean Journal of Operational Research, 2002
- Polygon decomposition for efficient construction of Minkowski sumsComputational Geometry, 2002
- Rotational polygon containment and minimum enclosure using only robust 2D constructionsComputational Geometry, 1999
- Jostling for position: local improvement for irregular cutting patternsJournal of the Operational Research Society, 1998
- Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effectComputers & Industrial Engineering, 1997
- A new algorithm for the minimal-area convex enclosure problemEuropean Journal of Operational Research, 1995
- Modeling of packing problemsOptimization, 1993
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- Cut out waste!OR Insight, 1992
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygonsComputational Geometry, 1991