Parallel algorithm for tiling problems

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticle

59 Citations (Scopus)

Abstract

A parallel algorithm for tiling with polyominoes is presented. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using l × m × n processing elements requires O(1) time, where l is the number of different kinds of polyominoes on an m × 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 printed circuit boards, and solving a variety of two- or three-dimensional packing problems.

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

Fingerprint

Parallel algorithms
Printed circuit boards
Integrated circuits
Processing

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Parallel algorithm for tiling problems. / Takefuji, Yoshiyasu; Lee, Kuo Chun.

In: IEEE Transactions on Neural Networks, Vol. 1, No. 1, 03.1990, p. 143-145.

Research output: Contribution to journalArticle

Takefuji, Yoshiyasu ; Lee, Kuo Chun. / Parallel algorithm for tiling problems. In: IEEE Transactions on Neural Networks. 1990 ; Vol. 1, No. 1. pp. 143-145.
@article{4cca54c2273a44b0a3d0af13f1bfe873,
title = "Parallel algorithm for tiling problems",
abstract = "A parallel algorithm for tiling with polyominoes is presented. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using l × m × n processing elements requires O(1) time, where l is the number of different kinds of polyominoes on an m × 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 printed circuit boards, and solving a variety of two- or three-dimensional packing problems.",
author = "Yoshiyasu Takefuji and Lee, {Kuo Chun}",
year = "1990",
month = "3",
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 - 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. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using l × m × n processing elements requires O(1) time, where l is the number of different kinds of polyominoes on an m × 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 printed circuit boards, and solving a variety of two- or three-dimensional packing problems.

AB - A parallel algorithm for tiling with polyominoes is presented. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using l × m × n processing elements requires O(1) time, where l is the number of different kinds of polyominoes on an m × 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 printed circuit boards, and solving a variety of two- or three-dimensional 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

VL - 1

SP - 143

EP - 145

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

SN - 2162-237X

IS - 1

ER -