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 条

[41] COMPUTING THE SHORTEST DIAGONAL OF A MONOTONE POLYGON IN LINEAR TIME
ZHU, BH
INFORMATION PROCESSING LETTERS, 1992, 42 (06) : 303 - 307
[42] Finding a shortest diagonal of a simple polygon in linear time
Comput Geom Theory Appl, 3 (149):
[43] LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON
MCCALLUM, D
AVIS, D
INFORMATION PROCESSING LETTERS, 1979, 9 (05) : 201 - 206
[44] Linear algorithm to find the largest intriangles of a planar convex polygon
Pujari, AK
Nataraj, A
KYBERNETES, 1996, 25 (05) : 53 - &
[45] A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polygon (Point-in-Polygon)
Ochilbek, Rakhmanov
2018 14TH INTERNATIONAL CONFERENCE ON ELECTRONICS COMPUTER AND COMPUTATION (ICECCO), 2018,
[46] An algorithm of the optimal inner point lies on the interior of a complex-polygon
Ou, GW
Ou, JZ
PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN & COMPUTER GRAPHICS, 1999, : 822 - 826
[47] AN OPTIMAL SPEED-UP PARALLEL ALGORITHM FOR TRIANGULATING SIMPLICIAL POINT SETS IN SPACE
ELGINDY, H
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1986, 15 (05) : 389 - 398
[48] SIMPLIFIED LINEAR-TIME JORDAN SORTING AND POLYGON CLIPPING
FUNG, KY
NICHOLL, TM
TARJAN, RE
VANWYK, CJ
INFORMATION PROCESSING LETTERS, 1990, 35 (02) : 85 - 92
[49] THE COMPUTATION OF THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME
WERNER, G
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (05): : 451 - 458
[50] FINDING THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME
SHIN, SY
WOO, TC
PATTERN RECOGNITION, 1986, 19 (06) : 453 - 458

← 1 2 3 4 5 →