THE AVERAGE PERFORMANCE ANALYSIS OF A CLOSEST-PAIR ALGORITHM

被引：2

作者：

CHANG, RC ^{[1
]}

LEE, RCT ^{[1
]}

机构：

[1] NATL TSINGHUA UNIV,DEPT ELECT ENGN,HSINCHU 300,TAIWAN

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1984年 / 16卷 / 02期

关键词：

D O I：

10.1080/00207168408803430

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：125 / 130

页数：6

共 16 条

[1]

Bentley J. L., 1976, P 8 ACM S THEOR COMP, P220

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

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229

[3] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J].

BENTLEY, JL ;

WEIDE, BW ;

YAO, AC .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04) :563-580

[4] DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

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

[5]

BLUM M, 1972, J COMPUTER SYSTEM SC, V7, P724

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

FORTUNE, S ;

HOPCROFT, J .

INFORMATION PROCESSING LETTERS, 1979, 8 (01) :20-23

[7] STOCHASTIC POINT PROCESSES - LIMIT THEOREMS [J].

GOLDMAN, JR .

ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (03) :771-&

[8] A LOWER BOUND FOR THE EXPECTED TRAVEL AMONG M-RANDOM POINTS [J].

MARKS, ES .

ANNALS OF MATHEMATICAL STATISTICS, 1948, 19 (03) :419-422

[9]

MILES R E, 1970, Mathematical Biosciences, V6, P85, DOI 10.1016/0025-5564(70)90061-1

[10]

RABIN MO, 1976, ALGORITHMS COMPLEXIT

← 1 2 →