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

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1989年 / 4卷 / 02期

关键词：

D O I：

10.1007/BF02187718

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：101 / 115

页数：15

共 50 条

[1] A SWEEP ALGORITHM FOR THE ALL-NEAREST-NEIGHBORS PROBLEM
HINRICHS, K
NIEVERGELT, J
SCHORN, P
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 333 : 43 - 54
[2] SYSTOLIC ARRAY FOR ALL-NEAREST-NEIGHBORS PROBLEM
PETKOV, N
ELECTRONICS LETTERS, 1987, 23 (24) : 1259 - 1260
[3] A SWEEP ALGORITHM AND ITS IMPLEMENTATION - THE ALL-NEAREST-NEIGHBORS PROBLEM REVISITED
HINRICHS, K
NIEVERGELT, J
SCHORN, P
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 442 - 457
[4] NEW SYSTOLIC ARRAY FOR ALL-NEAREST-NEIGHBORS PROBLEM
LIN, YC
ELECTRONICS LETTERS, 1992, 28 (11) : 1073 - 1074
[5] PROBABILISTIC ANALYSIS OF AN ALGORITHM FOR SOLVING THE K-DIMENSIONAL ALL-NEAREST-NEIGHBORS PROBLEM BY PROJECTION
BARTLING, F
HINRICHS, K
BIT, 1991, 31 (04): : 558 - 565
[6] All-nearest-neighbors queries in spatial databases
Zhang, J
Mamoulis, N
Papadias, D
Tao, YF
16TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2004, : 297 - 306
[7] All-nearest-neighbors finding based on the Hilbert curve
Chen, Hue-Ling
Chang, Ye-In
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (06) : 7462 - 7475
[8] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[9] AN O(N LOG N) ALGORITHM FOR A MAXMIN LOCATION PROBLEM
RANGAN, CP
GOVINDAN, R
DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 203 - 205
[10] An O(n log n) algorithm for the generalized birthday problem
Hwang, FK
Wright, PE
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 1997, 23 (04) : 443 - 451

← 1 2 3 4 5 →