DELAUNAY TRIANGULATION AND THE CONVEX-HULL OF N-POINTS IN EXPECTED LINEAR TIME

被引：59

作者：

MAUS, A ^{[1
]}

机构：

[1] NORWEGIAN COMP CTR, BOX 335, OSLO 3, NORWAY

来源：

关键词：

D O I：

10.1007/BF01937482

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：151 / 163

页数：13

共 16 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2] AKL SG, 1982, BIT, V22, P130
[3] BRASSEL KE, 1979, GEOGRAPH ANAL, V11
[4] Delaunay B., 1934, IZV AKAD NAUK SSSR O, P793
[5] EDDY WF, 1977, ACM T MATH SOFTWARE, V3, P4
[6] FOWLER RJ, 18 S FRAS U DEP GEOG
[7] Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2
[8] COMPUTING DIRICHLET TESSELLATIONS IN PLANE
GREEN, PJ
SIBSON, R
[J]. COMPUTER JOURNAL, 1978, 21 (02) : 168 - 173
[9] 2-DIMENSIONAL VORONOI DIAGRAMS IN THE LP-METRIC
LEE, DT
[J]. JOURNAL OF THE ACM, 1980, 27 (04) : 604 - 618
[10] 2 ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATION
LEE, DT
SCHACHTER, BJ
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (03): : 219 - 242