RELATIVE NEIGHBORHOOD GRAPHS AND THEIR RELATIVES

被引：408

作者：

JAROMCZYK, JW ^{[1
]}

TOUSSAINT, GT ^{[1
]}

机构：

[1] MCGILL UNIV, SCH COMP SCI, MONTREAL H3A 2A7, QUEBEC, CANADA

来源：

PROCEEDINGS OF THE IEEE | 1992年 / 80卷 / 09期

关键词：

COMPUTATIONAL GEOMETRY; COMPUTATIONAL MORPHOLOGY; GEOMETRIC GRAPHS; NEIGHBORHOOD GRAPHS; SPATIAL ANALYSIS;

D O I：

10.1109/5.163414

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This is a survey of results on neighborhood graphs. The paper discusses properties, bounds on the size, algorithms, and variants of the neighborhood graphs. Numerous applications including computational morphology, spatial analysis, pattern classification, and data bases for computer vision are described. A rich bibliography of the subject concludes the paper.

引用

页码：1502 / 1517

页数：16

共 114 条

[51] JAROMCZYK JW, 1987, 3RD P ACM S COMP GEO, P233
[52] JAROMCZYK JW, IN PRESS SIAM J COMP
[53] COMPUTING RELATIVE NEIGHBORHOOD GRAPHS IN THE PLANE
KATAJAINEN, J
NEVALAINEN, O
[J]. PATTERN RECOGNITION, 1986, 19 (03) : 221 - 228
[54] THE REGION APPROACH FOR COMPUTING RELATIVE NEIGHBORHOOD GRAPHS IN THE LP METRIC
KATAJAINEN, J
[J]. COMPUTING, 1988, 40 (02) : 147 - 161
[55] AN ALMOST NAIVE ALGORITHM FOR FINDING RELATIVE NEIGHBORHOOD GRAPHS IN LP METRICS
KATAJAINEN, J
NEVALAINEN, O
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 199 - 215
[56] A LINEAR EXPECTED-TIME ALGORITHM FOR COMPUTING PLANAR RELATIVE NEIGHBORHOOD GRAPHS
KATAJAINEN, J
NEVALAINEN, O
TEUHOLA, J
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (02) : 77 - 86
[57] KATAJAINEN J, 1987, THESIS U TURKU FINLA
[58] ILLUSORY CONTOURS CAN ARISE IN DOT FIGURES
KENNEDY, JM
WARE, C
[J]. PERCEPTION, 1978, 7 (02) : 191 - 194
[59] Kirkpatrick David G, 1985, MACHINE INTELLIGENCE
[60] KLINSCEK GT, 1980, ANN DISCRETE MATH, P121

← 1 2 3 4 5 6 7 8 9 10 →