A FAST VORONOI-DIAGRAM ALGORITHM WITH QUATERNARY TREE BUCKETING

被引：32

作者：

OHYA, T ^{[1
]}

IRI, M ^{[1
]}

MUROTA, K ^{[1
]}

机构：

[1] UNIV TOKYO,FAC ENGN,DEPT MATH ENGN & INSTRUMENTAT PHYS,BUNKYO KU,TOKYO 113,JAPAN

来源：

关键词：

D O I：

10.1016/0020-0190(84)90116-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：227 / 231

页数：5

共 8 条

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

[2] COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].

GREEN, PJ ;

SIBSON, R .

[3]

HORSPOOL RN, 1979, SOCS7912 MCGILL U TE

[4]

IMAI H, 1983, UNPUB SIAM J COMPUT

[5] HEURISTICS FOR PLANAR MINIMUM-WEIGHT PERFECT MATCHINGS [J].

IRI, M ;

MUROTA, K ;

MATSUI, S .

[6] GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANE [J].

LEE, DT ;

DRYSDALE, RL .

[7]

OHYA T, 1983, UNPUB J OPER RES SOC

[8]

Shamos M. I., 1975, 16TH P IEEE S F COMP, P151, DOI DOI 10.1109/SFCS.1975.8