Packing of convex polygons in a rectangularly bounded, non-homogeneous space

A two-dimensional heuristic packing strategy, capable of achieving a dense packing of convex polygonal shapes, is presented. A method for extending the placement strategy to nonconvex n-gons is also presented. The algorithm was developed as part of a system to automate the various aspects of the hardwood manufacturing industry. The techniques developed, however, are applicable to the packing problem in general.<
>