A COMBINATORIAL APPROACH TO POLYGON SIMILARITY

被引：11

作者：

AVIS, D

ELGINDY, H

机构：

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1983年 / 29卷 / 01期

关键词：

D O I：

10.1109/TIT.1983.1056600

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：148 / 150

页数：3

共 15 条

[1] IMPROVED ALGORITHM TO CHECK FOR POLYGON SIMILARITY [J].

AKL, SG ;

TOUSSAINT, GT .

INFORMATION PROCESSING LETTERS, 1978, 7 (03) :127-128

[2] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[3] POLYGON SIMILARITY [J].

BYKAT, A .

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

[4]

Chang T. L., 1976, 3rd International Joint Conference on Pattern Recognition, P208

[5] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT [J].

ELGINDY, H ;

AVIS, D .

JOURNAL OF ALGORITHMS, 1981, 2 (02) :186-197

[6]

ELGINDY H, 1981, UNPUB ALGORITHM DECO

[7] APPROXIMATE STRING MATCHING [J].

HALL, PAV ;

DOWLING, GR .

COMPUTING SURVEYS, 1980, 12 (04) :381-402

[8]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[9]

KNUTH DE, 1977, SIAM J COMPUT, V6, P240

[10]

MANACHER G, 1976, INFORM PROCESS LETT, V2, P6

← 1 2 →