A parallel algorithm for tiling with polyominoes is presented in this paper. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using 1 x m x n processing elements requires O (1) time where l is the number of different kinds of polyominoes on an m x n checkerboard. The algorithm can be used for placement of components or cells in a very large scale integrated circuit (VLSI) chip, designing and compacting printing circuit boards, and solving a variety of 2-D or 3-D packing problems.
|Number of pages||3|
|Journal||IEEE Transactions on Neural Networks|
|Publication status||Published - 1990 Mar|
ASJC Scopus subject areas
- Computer Science Applications
- Computer Networks and Communications
- Artificial Intelligence