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

beta

Finding

We propose an algorithm to verify guillotine restrictions in a two-dimensional covering model by establishing a connection between the connex components of a graph representation for the covering model and the guillotine cuts.

Paper

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

Citations: 4

2009

Full text

Semantic Scholar

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.

Authors

D. Marinescu, A. Baicoianu

Journal

WSEAS Transactions on Computers archive

copied to clipboard