An algorithm for the guillotine restrictions verification in a rectangular covering model

Authors:
Daniela Marinescu;Alexandra Baicoianu
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania
Venue:
WSEAS Transactions on Computers
Year:
2009

Citing 6
Cited 4

Introduction to algorithms

Introduction to algorithms
Triangle-based view Interpolation without depth-buffering

Journal of Graphics Tools
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
The determination of the guillotine restrictions for a rectangular covering model

ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers

An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern

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
The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern

Proceedings of the 15th WSEAS international conference on Computers
A test of the guillotine restrictions determination for a rectangular three dimensional bin packing problem

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Cutting and Covering problem with guillotine restrictions. In one of our previous works, we have shown the connection between the connex components of a graph representation for the covering model and the guillotine cuts. Based on this, in this paper we propose an algorithm which can be used to verify guillotine restrictions in a two-dimensional covering model.