THE RELATIVE NEIGHBORHOOD GRAPH OF A FINITE PLANAR SET

被引：654

作者：

TOUSSAINT, GT

机构：

来源：

PATTERN RECOGNITION | 1980年 / 12卷 / 04期

关键词：

D O I：

10.1016/0031-3203(80)90066-7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];

摘要：

引用

页码：261 / 268

页数：8

共 18 条

[1]

ARNHEIM R, 1974, ART VISUAL PERCEPTIO, P54

[2]

DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

INFORMATION PROCESSING LETTERS, 1978, 7 (02) :87-91

[3]

DEVROYE L, 1979, NOTE FINDING CONVEX

[4]

GILBERT EN, 1965, SIAM J APPL MATH, V13, P376

[5]

COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].

GREEN, PJ ;

SIBSON, R .

COMPUTER JOURNAL, 1978, 21 (02) :168-173

[6]

Harary F., 1972, GRAPH THEORY

[7]

JARVIS RA, 1978, 4TH P JOINT C PATT R, P308

[8]

LANKFORD PM, 1969, GEOGR ANAL, V1, P196

[9]

TRIANGULATION OF PLANAR REGIONS WITH APPLICATIONS [J].

LEWIS, BA ;

ROBINSON, JS .

COMPUTER JOURNAL, 1978, 21 (04) :324-332

[10]

ALTERNATIVE DEFINITION FOR NEIGHBORHOOD-OF-A-POINT [J].

OCALLAGHAN, JF .

IEEE TRANSACTIONS ON COMPUTERS, 1975, 24 (11) :1121-1125

← 1 2 →