Introduction to algorithms
A decomposition problem of a natural number for a rectangular cutting-covering model
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
A topological order for a rectangular covering problem
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
A plan of lauding the boxes for a three dimensional bin packing model
WSEAS TRANSACTIONS on SYSTEMS
An algorithm for the guillotine restrictions verification in a rectangular covering model
WSEAS Transactions on Computers
The determination of the guillotine restrictions for a rectangular cutting-stock pattern
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Proceedings of the 15th WSEAS international conference on Computers
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
Starting from a two-dimensional rectangular Cutting-Stock pattern with gaps, this paper is focuses on the problem of determination if the pattern is with guillotine restrictions or not and proposes an algorithm for solving it. First we present two new graph representations of the cutting pattern, weighted graph of downward adjacency and weighted graph of rightward adjacency. Using these representations we propose a method to verify guillotine restrictions of the pattern which can be apply for cutting-stock pattern with gaps but also for the cutting or covering pattern without gaps and overlapping.