Atlas home || Conferences | Abstracts | about Atlas

2nd International Conference on Symmetry and Antisymmetry in Mathematics, Formal Languages and Computer Science
June 29 - July 1, 2000
"Transylvania" University of Brasov
Brasov, Romania

Organizers
Gabriel V. Orman, Radu Paltanea, Dorin Bocu, N. Pascu, E. Popescu, O. Popescu, I. Radomir, L. Sangeorzan, M. Neagu, E. Paltanea, D. Raducanu

View Abstracts
Conference Homepage

A rectangular covering problem
by
Paul Iacob
Transilvania University of Brasov
Coauthors: Daniela Marinescu (Transilvania University of Brasov), Cristina Luca (Transilvania University of Brasov)

We consider a covering problem of a rectangular plate A by a set of n rectangles B1, B2, ..., Bn. To prove optimality of a covering algorithm (presented in our previous paper) we prove that for n <= 4 all the covering model are with guillotine restrictions and for n=5 there is only one class of equivalent models without guillotine restrictions. We present also two algorithms: one for verifies of guillotine restrictions and one for generates the set of covering models.

Date received: March 8, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caet-20.