GENERALIZED DELAUNAY TRIANGULATION FOR PLANAR GRAPHS

被引：162

作者：

LEE, DT

LIN, AK

机构：

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1986年 / 1卷 / 03期

关键词：

D O I：

10.1007/BF02187695

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：201 / 217

页数：17

共 30 条

[1] Visibility of Disjoint Polygons [J].

Asano, Takao ;

Asano, Tetsuo ;

Guibas, Leonidas ;

Hershberger, John ;

Imai, Hiroshi .

ALGORITHMICA, 1986, 1 (1-4) :49-63

[2] ANGLE CONDITION IN FINITE-ELEMENT METHOD [J].

BABUSKA, I ;

AZIZ, AK .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1976, 13 (02) :214-226

[3] TRIANGULAR ELEMENTS IN FINITE ELEMENT METHOD [J].

BRAMBLE, JH ;

ZLAMAL, M .

MATHEMATICS OF COMPUTATION, 1970, 24 (112) :809-+

[4]

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

[5]

Chazelle B., 1982, 23rd Annual Symposium on Foundations of Computer Science, P339, DOI 10.1109/SFCS.1982.58

[6]

CHAZELLE BM, 1983, 21ST P ALL C COMM CO, P447

[7]

EDELSBRUNNER H, IN PRESS SIAM J COMP

[8] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT [J].

ELGINDY, H ;

AVIS, D .

JOURNAL OF ALGORITHMS, 1981, 2 (02) :186-197

[9]

Frederick C. O., 1970, INT J NUMER METHODS, V2, P133, DOI DOI 10.1002/NME.1620020112

[10] TRIANGULATING A SIMPLE POLYGON [J].

GAREY, MR ;

JOHNSON, DS ;

PREPARATA, FP ;

TARJAN, RE .

INFORMATION PROCESSING LETTERS, 1978, 7 (04) :175-179

← 1 2 3 →