Recursive Algorithm for Unconstrained Two-Dimensional Guillotine Cutting Problem of Rectangular Pieces

The sheet is recursively cut into a series of rectangular blocks.For the current block considered,it optimally selects a piece,puts it at the left-bottom corner of the block,and determines whether the next cut should be aligned along its upper edge or right edge to get two smaller blocks for further layout. Benchmark tests reported in the literature are used to evaluate the algorithm,comparison indicates that its computation time is acceptable for practical use,and the material usage of the layout is higher than that of other algorithms.