AN ALMOST NAIVE ALGORITHM FOR FINDING RELATIVE NEIGHBORHOOD GRAPHS IN LP METRICS

被引：1

作者：

KATAJAINEN, J

NEVALAINEN, O

机构：

来源：

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1987年 / 21卷 / 02期

关键词：

D O I：

10.1051/ita/1987210201991

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：199 / 215

页数：17

共 18 条

[1] EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING
BENTLEY, JL
MAURER, HA
[J]. ACTA INFORMATICA, 1980, 13 (02) : 155 - 168
[2] ELEMENTARY PROOF OF NONEXISTENCE OF ISOMETRIES BETWEEN LPK AND LQK
COPPERSMITH, D
LEE, DT
WONG, CK
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1979, 23 (06) : 696 - 699
[3] FRANKL P, 1985, COMMUNICATION 0523
[4] GUY RK, 1969, RECENT PROGR COMBINA, P237
[5] Hylten-Cavallius C., 1958, COLLOQ MATH-WARSAW, V6, P59, DOI [10.4064/cm-6-1-61-65, DOI 10.4064/CM-6-1-61-65]
[6] COMPUTING RELATIVE NEIGHBORHOOD GRAPHS IN THE PLANE
KATAJAINEN, J
NEVALAINEN, O
[J]. PATTERN RECOGNITION, 1986, 19 (03) : 221 - 228
[7] KATAJAINEN J, 1985, B36 U TURK DEP COMP
[8] KATAJAINEN J, IN PRESS INFORMATION
[9] KOPPINEN M, 1985, COMMUNICATION 1218
[10] COMPUTING THE RELATIVE NEIGHBORHOOD GRAPH IN THE L1 AND L-INFINITY METRICS
OROURKE, J
[J]. PATTERN RECOGNITION, 1982, 15 (03) : 189 - 192