DYNAMIC VORONOI DIAGRAMS

被引：32

作者：

GOWDA, IG

KIRKPATRICK, DG

LEE, DT

NAAMAD, A

机构：

[1] UNIV BRITISH COLUMBIA, DEPT COMP SCI, VANCOUVER V6T 1W5, BC, CANADA

[2] NORTHWESTERN UNIV, INST TECHNOL, DEPT ELECT ENGN & COMP SCI, EVANSTON, IL 60201 USA

来源：

关键词：

D O I：

10.1109/TIT.1983.1056738

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：724 / 731

页数：8

共 30 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] DECOMPOSABLE SEARCHING PROBLEMS [J].

BENTLEY, JL .

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

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