OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS

被引：188

作者：

BENTLEY, JL

WEIDE, BW

YAO, AC

机构：

[1] OHIO STATE UNIV, DEPT COMP & INFORMAT SCI, COLUMBUS, OH 43210 USA

[2] STANFORD UNIV, DEPT COMP SCI, STANFORD, CA 94305 USA

来源：

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1980年 / 6卷 / 04期

关键词：

D O I：

10.1145/355921.355927

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：563 / 580

页数：18

共 22 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[3]

BENTLEY JL, 1978, IEEE T COMPUT, V27, P97, DOI 10.1109/TC.1978.1675043

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

BENTLEY, JL .

[5]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[6]

Dobkin D., 1976, SIAM Journal on Computing, V5, P181, DOI 10.1137/0205015

[7] NOTE ON RABINS NEAREST-NEIGHBOR ALGORITHM [J].

FORTUNE, S ;

HOPCROFT, J .

[8]

Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745

[9]

HORSPOOL RN, 1979, SOCS7912 MCGILL U CO

[10]

Kirkpatrick D. G., 1979, 20th Annual Symposium of Foundations of Computer Science, P18, DOI 10.1109/SFCS.1979.15