A PARALLEL ALGORITHM FOR FINDING CONGRUENT REGIONS

被引：8

作者：

SHIH, ZC

LEE, RCT

YANG, SN

机构：

[1] NATL CHIAO TUNG UNIV,INST COMP & INFORMAT SCI,HSINCHU,TAIWAN

[2] NATL TSING HUA UNIV,INST COMP & DECIS SCI,HSINCHU 30043,TAIWAN

来源：

PARALLEL COMPUTING | 1990年 / 13卷 / 02期

关键词：

complexity analysis; computational geometry; congruent region; Parallel algorithm;

D O I：

10.1016/0167-8191(90)90142-V

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we discuss the problem of finding all the regions, which are congruent to a testing region, in a planar figure. A parallel algorithm is developed to find all of these regions. This algorithm takes O(n2) computation time and needs O(m) processors where n and m are the numbers of edges of the input planar figure and the testing region respectively. © 1990.

引用

页码：135 / 142

页数：8

共 15 条

[1]

Aggarwal A., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P468, DOI 10.1109/SFCS.1985.42

[2]

AKL AG, 1978, INF P LETT, V7, P127

[3]

ALT H, 1987, 3RD P ANN S COMP GEO, P308

[4] CHECKING SIMILARITY OF PLANAR FIGURES [J].

ATALLAH, MJ .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (04) :279-290

[5]

ATALLAH MJ, 1985, 1985 P INT C PAR PRO, P411

[6] AN OPTIMAL ALGORITHM FOR GEOMETRICAL CONGRUENCE [J].

ATKINSON, MD .

JOURNAL OF ALGORITHMS, 1987, 8 (02) :159-172

[7]

Ballard DH, 1982, COMPUTER VISION

[8]

BAUDET G, 1978, IEEE T COMPUT, V27, P84, DOI 10.1109/TC.1978.1674957

[9] POLYGON SIMILARITY [J].

BYKAT, A .

INFORMATION PROCESSING LETTERS, 1979, 9 (01) :23-25

[10]

CHOW A, 1981, THESIS U ILLINOIS UR

← 1 2 →