A FASTER DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING DELAUNAY TRIANGULATIONS

被引：119

作者：

DWYER, RA

机构：

来源：

关键词：

D O I：

10.1007/BF01840356

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：137 / 151

页数：15

共 16 条

[1] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS
BENTLEY, JL
WEIDE, BW
YAO, AC
[J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04): : 563 - 580
[2] FORTUNE S, 1986, 2ND P ANN S COMP GEO, P313
[3] PRIMITIVES FOR THE MANIPULATION OF GENERAL SUBDIVISIONS AND THE COMPUTATION OF VORONOI DIAGRAMS
GUIBAS, L
STOLFI, J
[J]. ACM TRANSACTIONS ON GRAPHICS, 1985, 4 (02): : 74 - 123
[4] O(N LOG N) ALGORITHM FOR RECTILINEAR MINIMAL SPANNING TREES
HWANG, FK
[J]. JOURNAL OF THE ACM, 1979, 26 (02) : 177 - 182
[5] Lawson CL, 1997, MATH SOFTWARE, P161, DOI [DOI 10.1016/B978-0-12-587260-7.50011-X, 10.1016/B978-0-12-587260-7.50011-X]
[6] 2-DIMENSIONAL VORONOI DIAGRAMS IN THE LP-METRIC
LEE, DT
[J]. JOURNAL OF THE ACM, 1980, 27 (04) : 604 - 618
[7] 2 ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATION
LEE, DT
SCHACHTER, BJ
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (03): : 219 - 242
[8] VORONOI DIAGRAMS IN L1 (L INFINITY) METRICS WITH TWO-DIMENSIONAL STORAGE APPLICATIONS
LEE, DT
WONG, CK
[J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 200 - 211
[9] DELAUNAY TRIANGULATION AND THE CONVEX-HULL OF N-POINTS IN EXPECTED LINEAR TIME
MAUS, A
[J]. BIT NUMERICAL MATHEMATICS, 1984, 24 (02) : 151 - 163
[10] MCLAIN DH, 1976, COMPUT J, V19, P384