Letters: A Parallel Algorithm for Tiling Problems

Yoshiyasu Takefuji; Kuo Chun Lee

doi:10.1109/72.80215

Letters: A Parallel Algorithm for Tiling Problems

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journal › Article › peer-review

63 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	143-145
Number of pages	3
Journal	IEEE Transactions on Neural Networks
Volume	1
Issue number	1
DOIs	https://doi.org/10.1109/72.80215
Publication status	Published - 1990 Mar
Externally published	Yes

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1109/72.80215

Cite this

@article{4cca54c2273a44b0a3d0af13f1bfe873,

title = "Letters: A Parallel Algorithm for Tiling Problems",

abstract = "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.",

author = "Yoshiyasu Takefuji and Lee, {Kuo Chun}",

year = "1990",

month = mar,

doi = "10.1109/72.80215",

language = "English",

volume = "1",

pages = "143--145",

journal = "IEEE Transactions on Neural Networks and Learning Systems",

issn = "2162-237X",

publisher = "IEEE Computational Intelligence Society",

number = "1",

}

TY - JOUR

T1 - Letters

T2 - A Parallel Algorithm for Tiling Problems

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

PY - 1990/3

Y1 - 1990/3

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

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

UR - http://www.scopus.com/inward/record.url?scp=0025402285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025402285&partnerID=8YFLogxK

U2 - 10.1109/72.80215

DO - 10.1109/72.80215

M3 - Article

AN - SCOPUS:0025402285

SN - 2162-237X

VL - 1

SP - 143

EP - 145

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

IS - 1

ER -

Letters: A Parallel Algorithm for Tiling Problems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this