Finding a shortest diagonal of a simple polygon in linear time

被引：0

|

作者：

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 149期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[31] FINDING THE CONVEX-HULL OF A SIMPLE POLYGON
GRAHAM, RL
YAO, FF
JOURNAL OF ALGORITHMS, 1983, 4 (04) : 324 - 331
[32] ON FINDING THE CONVEX-HULL OF A SIMPLE POLYGON
LEE, DT
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (02): : 87 - 98
[33] New algorithm for finding the kernel of a simple polygon
Liu, Guanghui
Chen, Chuanbo
Lu, Zehua
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2007, 35 (12): : 1 - 4
[34] Shortest paths in simple polygons with polygon-meet constraints
Khosravi, R
Ghodsi, M
INFORMATION PROCESSING LETTERS, 2004, 91 (04) : 171 - 176
[35] Optimally computing the shortest weakly visible subedge of a simple polygon
Chen, DZ
JOURNAL OF ALGORITHMS, 1996, 20 (03) : 459 - 478
[36] THE COMPUTATION OF THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME - COMMENT
ELGINDY, H
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1987, 6 (05): : 437 - 440
[37] A LINEAR TIME ALGORITHM FOR MINIMUM LINK PATHS INSIDE A SIMPLE POLYGON
SURI, S
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 35 (01): : 99 - 110
[38] A LINEAR TIME ALGORITHM FOR OBTAINING THE CONVEX-HULL OF A SIMPLE POLYGON
GHOSH, SK
SHYAMASUNDAR, RK
PATTERN RECOGNITION, 1983, 16 (06) : 587 - 592
[39] EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
KIM, SH
SHIN, SY
CHWA, KY
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (04) : 433 - 458
[40] A linear time algorithm for minimum conic link path in a simple polygon
Chou, Shuo-Yan
Chou, Chang-Chien
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 45 : 286 - 293

← 1 2 3 4 5 →