GEOMETRIC ALGORITHMS FOR DIGITIZED PICTURES ON A MESH-CONNECTED COMPUTER

被引：46
作者：
MILLER, R
STOUT, QF
机构：
来源：
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1985年 / 7卷 / 02期
关键词：
D O I：
10.1109/TPAMI.1985.4767645
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：216 / 228
页数：13
相关论文
共 50 条
[41]   K-FOLD BITONIC SORT ON A MESH-CONNECTED PARALLEL COMPUTER [J].
HSIAO, CC ;
SHEN, NT .
INFORMATION PROCESSING LETTERS, 1985, 21 (04) :207-212
[42]   THETA(1) TIME QUADTREE ALGORITHM AND ITS APPLICATION FOR IMAGE GEOMETRIC-PROPERTIES ON A MESH-CONNECTED COMPUTER (MCC) [J].
ELMESBAHI, J ;
BOUATTANE, O ;
BENABBOU, Z .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (12) :1640-1648
[43]   Efficient parallel algorithms for selection and multiselection on mesh-connected computers (short version) [J].
Shen, H .
IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, :426-430
[44]   MODIFIED MESH-CONNECTED PARALLEL COMPUTERS [J].
CARLSON, DA .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (10) :1315-1321
[45]   ITERATIVE ALGORITHMS FOR THE PLANAR CONVEX-HULL PROBLEM ON MESH-CONNECTED ARRAYS [J].
HOLEY, JA ;
IBARRA, OH .
PARALLEL COMPUTING, 1992, 18 (03) :281-296
[46]   SYSTOLIC SORTING ON A MESH-CONNECTED NETWORK [J].
LANG, HW ;
SCHIMMLER, M ;
SCHMECK, H ;
SCHRODER, H .
IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (07) :652-658
[47]   ON DEPENDABILITY EVALUATION OF MESH-CONNECTED PROCESSORS [J].
MOHAPATRA, P ;
DAS, CR .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (09) :1073-1084
[48]   ALGORITHMS TO REALIZE AN ARBITRARY BPC PERMUTATION IN CHORDAL RING NETWORKS AND MESH-CONNECTED NETWORKS [J].
MASUYAMA, H .
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1994, E77D (10) :1118-1129
[49]   PARALLEL VORONOI DIAGRAM IN L1 (LINFINITY) METRIC ON A MESH-CONNECTED COMPUTER [J].
JEONG, CS .
PARALLEL COMPUTING, 1991, 17 (2-3) :241-252
[50]   LOWER BOUNDS FOR SORTING ON MESH-CONNECTED ARCHITECTURES [J].
KUNDE, M .
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 227 :84-95
12345