Title :
Packing of convex polygons in a rectangularly bounded, non-homogeneous space
Author :
Kothari, Ravi ; Klinkhachorn, P.
Author_Institution :
Dept. of Electr. & Comput. Eng., West Virginia Univ., Morgantown, WV, USA
Abstract :
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
Keywords :
computational geometry; operations research; optimisation; production control; wood processing; 2D heuristic packing strategy; convex polygons; hardwood manufacturing industry; nonhomogeneous space; operations research; optimisation; Aerospace industry; Computer aided manufacturing; Computer industry; Computer vision; Decision making; Geometry; Laser beam cutting; Manufacturing industries; Shape; Wood industry;
Conference_Titel :
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location :
Tallahassee, FL
Print_ISBN :
0-8186-1933-3
DOI :
10.1109/SSST.1989.72461
