A topological order for a rectangular covering problem

Authors:
Daniela Marinescu;Paul Iacob;Kinga Kiss-Iakab
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 2
Cited 4

Introduction to algorithms

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

Journal of Graphics Tools

A plan of lauding the boxes for a three dimensional bin packing model

WSEAS TRANSACTIONS on SYSTEMS
A topological order for a rectangular three dimensional bin packing problem

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
An algorithm for the guillotine restrictions verification in a rectangular covering model

WSEAS Transactions on Computers
An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a rectangular covering problem, where a rectangular support P is covered by k rectangular pieces Ci, for i=1, 2,..., k, without gaps or overlapping. We intend to cover the support P with the k pieces in a certain order so that, at the moment of the placement of the piece Ci, the northern and western borders of this piece are completely covered. Starting from a graph representation of a covering model we prove that this order is a topological order. We present a kind of topological sorting for this problem, of linear complexity. At the end we present some practical applications of this topological order.