A LINEAR TIME ALGORITHM FOR TRIANGULATING A POINT-VISIBLE POLYGON

被引：0

作者：

WOO, TC ^{[1
]}

SHIN, SY ^{[1
]}

机构：

[1] UNIV MICHIGAN,DEPT IND & OPERAT ENGN,ANN ARBOR,MI 48109

来源：

ACM TRANSACTIONS ON GRAPHICS | 1985年 / 4卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：60 / 69

页数：10

共 50 条

[1] A randomized algorithm for triangulating a simple polygon in linear time
Amato, NM
Goodrich, MT
Ramos, EA
DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 26 (02) : 245 - 265
[2] A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
N. M. Amato
M. T. Goodrich
E. A. Ramos
Discrete & Computational Geometry, 2001, 26 : 245 - 265
[3] TRIANGULATING A SIMPLE POLYGON IN LINEAR TIME
CHAZELLE, B
DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (05) : 485 - 524
[4] Triangulating a simple polygon in linear time
Chazelle, Bernard
IEEE Transactions on Industry Applications, 1991, 27 (1 pt 1) : 220 - 230
[5] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT
ELGINDY, H
AVIS, D
JOURNAL OF ALGORITHMS, 1981, 2 (02) : 186 - 197
[6] A FAST LAS-VEGAS ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
CLARKSON, KL
TARJAN, RE
VANWYK, CJ
DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) : 423 - 432
[7] AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
TARJAN, RE
VANWYK, CJ
SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 143 - 178
[8] A LINEAR TIME ALGORITHM FOR COMPUTING THE SHORTEST LINE SEGMENT FROM WHICH A POLYGON IS WEAKLY EXTERNALLY VISIBLE
BHATTACHARYA, BK
MUKHOPADHYAY, A
TOUSSAINT, GT
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 412 - 424
[9] A visible polygon reconstruction algorithm
Sechrest, Stuart
Greenberg, Donald P.
ACM Transactions on Graphics, 1982, 1 (01): : 25 - 42
[10] ON THE CORRECTNESS OF A LINEAR-TIME VISIBILITY POLYGON ALGORITHM
JOE, B
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 32 (3-4) : 155 - 172

← 1 2 3 4 5 →