AN O(N LOG N) ALGORITHM FOR THE ALL-NEAREST-NEIGHBORS PROBLEM

被引：143

作者：

VAIDYA, PM ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

关键词：

D O I：

10.1007/BF02187718

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：101 / 115

页数：15

共 11 条

[1] COMPLEXITY OF FINDING FIXED-RADIUS NEAR NEIGHBORS [J].

BENTLEY, JL ;

STANAT, DF ;

WILLIAMS, EH .

[2] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].

BENTLEY, JL .

[3]

BENTLEY JL, 1982, ACM T MATH SOFTWARE, V6, P563

[4]

Clarkson K. L., 1983, 24th Annual Symposium on Foundations of Computer Science, P226, DOI 10.1109/SFCS.1983.16

[5]

Preparata F. P., 2012, COMPUTATIONAL GEOMET

[6]

Rabin M.O., 1976, ALGORITHMS COMPLEXIT, P21

[7]

Reingold E. M., 1977, COMBINATORIAL ALGORI

[8]

Shamos MI, 1978, THESIS YALE U NEW HA

[9]

YYUVAL F, 1975, INFORM PROCESS LETT, V3, P113

[10]

[No title captured]