Some properties of the planar Euclidean relative neighbourhood graph

被引：14

作者：

Urquhart, Roderick B. ^{[1
]}

机构：

[1] GEC Res Labs, Hirst Res Ctr, Wembley, England

来源：

PATTERN RECOGNITION LETTERS | 1983年 / 1卷 / 5-6期

关键词：

Relative neighbourhood graph; Gabriel graph; pattern recognition;

D O I：

10.1016/0167-8655(83)90070-3

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Some simple properties of the planar Euclidean relative neighbourhood graph are derived. Interesting properties are already known for a similar structure - the Gabriel graph - and a comparison of analogous properties is given.

引用

页码：317 / 322

页数：6

共 11 条

[1] MATULA DW, 1980, GEOGR ANAL, V12, P205
[2] COMPUTING THE RELATIVE NEIGHBORHOOD GRAPH IN THE L1 AND L-INFINITY METRICS
OROURKE, J
[J]. PATTERN RECOGNITION, 1982, 15 (03) : 189 - 192
[3] Shamos Michael I., 1978, THESIS YALE U
[4] Toussaint G. T., 1980, Proceedings of the 5th International Conference on Pattern Recognition, P1324
[5] Toussaint G.T., 1980, METHODS OPERATIONS R
[6] Toussaint G. T., 1981, P 1981 IEEE INT S IN, P66
[7] Toussaint G.T., 1980, P ALL C URB US
[8] THE RELATIVE NEIGHBORHOOD GRAPH OF A FINITE PLANAR SET
TOUSSAINT, GT
[J]. PATTERN RECOGNITION, 1980, 12 (04) : 261 - 268
[9] GRAPH THEORETICAL CLUSTERING BASED ON LIMITED NEIGHBORHOOD SETS
URQUHART, R
[J]. PATTERN RECOGNITION, 1982, 15 (03) : 173 - 187
[10] Urquhart R.B., 1983, THESIS U GLASGOW

← 1 2 →