DYNAMIC VORONOI DIAGRAMS

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 244 - 251

[3] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04): : 563 - 580

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

[5] EDELSBRUNNER H, 1979, TU35 GRAZ I INF VER

[6] GOWDA IG, 1980, THESIS U BRIT COLUMB

[7] GOWDA IG, 1980, 18TH P ANN ALL C COM, P1

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

[9] KIRKPATRICK DG, 1983, SIAM J COMPUT FEB, P28

[10] Knuth D. E., 1973, ART COMPUTER PROGRAM

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 244 - 251

[3] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04): : 563 - 580

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

[5] EDELSBRUNNER H, 1979, TU35 GRAZ I INF VER

[6] GOWDA IG, 1980, THESIS U BRIT COLUMB

[7] GOWDA IG, 1980, 18TH P ANN ALL C COM, P1

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

[9] KIRKPATRICK DG, 1983, SIAM J COMPUT FEB, P28

[10] Knuth D. E., 1973, ART COMPUTER PROGRAM