AN OPTIMAL PARALLEL ALGORITHM FOR TRIANGULATING A SET OF POINTS IN THE PLANE

被引：8

作者：

MERKS, E ^{[1
]}

机构：

[1] SIMON FRASER UNIV,SCH COMP SCI,BURNABY V5A 1S6,BC,CANADA

来源：

关键词：

D O I：

10.1007/BF01414464

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：399 / 411

页数：13

共 12 条

[1] SORTING IN C LOG N PARALLEL STEPS [J].

AJTAI, M ;

KOMLOS, J ;

SZEMEREDI, E .

[2]

Asano T., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P155, DOI 10.1109/SFCS.1985.65

[3]

ATALLAH M, 1985 P INT C PAR P, P411

[4]

BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

[5]

Cavendish J. C., 1974, International Journal for Numerical Methods in Engineering, V8, P679, DOI 10.1002/nme.1620080402

[6]

ELGINDY H, 1986, OPTIMAL PARALLEL ALG

[7]

GOODRICH M, 1985, 2ND P S COMP GEOM YO

[8] THE POWER OF PARALLEL PREFIX [J].

KRUSKAL, CP ;

RUDOLPH, L ;

SNIR, M .

[9]

Lawson C.L., 1976, C1 COMPATIBLE INTERP, P33

[10]

Shamos Michael I., 1978, THESIS YALE U