The determination of the guillotine restrictions for 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:
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Year:
2009

Citing 3
Cited 1

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

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

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].