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

[1] COMPLEXITY OF FINDING FIXED-RADIUS NEAR NEIGHBORS [J]. INFORMATION PROCESSING LETTERS, 1977, 6 (06) : 209 - 212

[2] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229

[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]

[1] COMPLEXITY OF FINDING FIXED-RADIUS NEAR NEIGHBORS [J]. INFORMATION PROCESSING LETTERS, 1977, 6 (06) : 209 - 212

[2] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229

[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]