A FAST LAS-VEGAS ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON

被引：22

作者：

CLARKSON, KL ^{[1
]}

TARJAN, RE ^{[1
]}

VANWYK, CJ ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

来源：

关键词：

D O I：

10.1007/BF02187741

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：423 / 432

页数：10

共 15 条

[1] Atallah M. J., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P151, DOI 10.1109/SFCS.1987.12
[2] TRIANGULATION AND SHAPE-COMPLEXITY
CHAZELLE, B
INCERPI, J
[J]. ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02): : 135 - 152
[3] CLARKSON K, 1988, 4TH P ANN ACM S COMP, P18
[4] CLARKSON K, COMMUNICATION
[5] NEW APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY
CLARKSON, KL
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 195 - 222
[6] APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY .2.
CLARKSON, KL
SHOR, PW
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) : 387 - 421
[7] CLARKSON KL, 1988, 4TH P ANN ACM S COMP, P1
[8] Erdos P., 1974, PROBABILISTIC METHOD
[9] TRIANGULATING SIMPLE POLYGONS AND EQUIVALENT PROBLEMS
FOURNIER, A
MONTUNO, DY
[J]. ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02): : 153 - 174
[10] FUNG KY, UNPUB ACM T GRAPHICS