Letters: A Parallel Algorithm for Tiling Problems

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticlepeer-review

64 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)143-145
Number of pages3
JournalIEEE Transactions on Neural Networks
Issue number1
Publication statusPublished - 1990 Mar
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Letters: A Parallel Algorithm for Tiling Problems'. Together they form a unique fingerprint.

Cite this