A problem of relevant interest to some industries is that of optimum two-dimensional layout. In this problem, one is given a number of rectangular sheets and an order for a specified number of each of certain types of two-dimensional regular and irregular shapes. The aim is to cut the shapes out of the sheets in such a way as to minimize the amount of waste produced. A two-stage solution is proposed in which the problem is converted from one of placing irregularly shaped pieces to one of allocating rectangular modules. The clustering algorithm used in the first stage to produce rectangular modules is presented and the results obtained when it was applied to some typical layout problems are described.

  • Availability:
  • Corporate Authors:

    IPC Science and Technology Press Limited

    IPC House, 32 High Street
    Guildford, Surrey  England 
  • Authors:
    • Adamowicz, M
    • Albano, A
  • Publication Date: 1976-1

Media Info

  • Features: References;
  • Pagination: p. 27-33
  • Serial:
    • Computer Aided Design
    • Volume: 8
    • Issue Number: 1
    • Publisher: Butterworth Scientific Limited
    • ISSN: 0010-4485

Subject/Index Terms

Filing Info

  • Accession Number: 00138033
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Aug 23 1976 12:00AM