An algorithm for polygon placement using a bottom-left strategy
Authors:
- Kathryn A. DowslandKDKathryn A. Dowsland
- Subodh VaidSVSubodh Vaid
- William B. DowslandWDWilliam B. Dowsland
- 1 September 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 141 (2) , 371-381
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The irregular cutting-stock problem — a new procedure for deriving the no-fit polygonComputers & Operations Research, 2001
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectanglesEuropean Journal of Operational Research, 1999
- Jostling for position: local improvement for irregular cutting patternsJournal of the Operational Research Society, 1998
- Nesting of two-dimensional irregular parts using a shape reasoning heuristicComputer-Aided Design, 1997
- On genetic algorithms for the packing of polygonsEuropean Journal of Operational Research, 1996
- Compaction and separation algorithms for non-convex polygons and their applicationsEuropean Journal of Operational Research, 1995
- An algebra of polygons through the notion of negative shapesCVGIP: Image Understanding, 1991
- Marker-making using automatic placement of irregular shapes for the garment industryComputers & Graphics, 1990
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- An improved BL lower boundInformation Processing Letters, 1980