The determination of the guillotine restrictions for a rectangular covering model
Daniela Marinescu, Alexandra Băicoianu · Annual Conference on Computers · 2009
We consider a rectangular covering model, where a rectangular support P is covered by k rectangular pieces Ci, for i=1, 2, ..., k, without gaps or overlapping. Using a pictural representation of this model we had given in [15, 16] an algorithm for determination of the guillotine restrictions in a covering model by means of bidimensional Turing machines. We present now a better algorithm, based on decomposition of a graph in conex components, using a graph representation of the covering model defined by us in [12, 13].