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 条

[31] AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES
Wang, Haitao
Zhang, Jingru
SIAM JOURNAL ON COMPUTING, 2021, 50 (02) : 602 - 635
[32] An O(n log n) algorithm for the Maximum Agreement Subtree problem for binary trees
Cole, R
Hariharan, R
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 323 - 332
[33] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
Spoerhase, J.
Wirth, H. -C.
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
[34] Algorithm for finding all k nearest neighbors
Piegl, LA
Tiller, W
COMPUTER-AIDED DESIGN, 2002, 34 (02) : 167 - 172
[35] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
KIM, T
CHWA, KY
INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
[36] An O(N log N) algorithm for shape modeling
Malladi, R.
Sethian, J. A.
Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
[37] AN O(N LOG N) MANHATTAN PATH ALGORITHM
LIPSKI, W
INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
[38] An O(N log N) algorithm for shape modeling
Malladi, R
Sethian, JA
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
[39] An optimal O(log log N)-time parallel algorithm for detecting all squares in a string
Apostolico, A
Breslauer, D
SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1318 - 1331
[40] AN O(N LOG N) RANDOMIZING ALGORITHM FOR THE WEIGHTED EUCLIDEAN 1-CENTER PROBLEM
MEGIDDO, N
ZEMEL, E
JOURNAL OF ALGORITHMS, 1986, 7 (03) : 358 - 368

← 1 2 3 4 5 →