Finding a shortest diagonal of a simple polygon in linear time

被引：0

作者：

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 149期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[41] Finding the k Shortest Simple Paths: Time and Space Trade-offs
Al Zoobi A.
Coudert D.
Nisse N.
ACM Journal of Experimental Algorithmics, 2023, 28 (01):
[42] Finding shortest safari routes in simple polygons
Tan, XH
Hirata, T
INFORMATION PROCESSING LETTERS, 2003, 87 (04) : 179 - 186
[43] 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
[44] Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
Asano, Tetsuo
Mulzer, Wolfgang
Wang, Yajun
WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 9 - +
[45] AN EFFICIENT ALGORITHM FOR FINDING THE CSG REPRESENTATION OF A SIMPLE POLYGON
DOBKIN, D
GUIBAS, L
HERSHBERGER, J
SNOEYINK, J
ALGORITHMICA, 1993, 10 (01) : 1 - 23
[46] Computing a shortest weakly externally visible line segment for a simple polygon
Bhattacharya, BK
Mukhopadhyay, A
Toussaint, GT
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1999, 9 (01) : 81 - 96
[47] A NEW DATA STRUCTURE FOR SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
HERSHBERGER, J
INFORMATION PROCESSING LETTERS, 1991, 38 (05) : 231 - 235
[48] A linear-time randomized algorithm for the bounded voronoi diagram of a simple polygon
Klein, R
Lingas, A
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (03) : 263 - 278
[49] Finding the shortest path in the shortest time using PCNN's
Caulfield, HJ
Kinser, JM
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (03): : 604 - 606
[50] Diagonal of a regular polygon
Chapman, R
AMERICAN MATHEMATICAL MONTHLY, 2006, 113 (01): : 80 - 81

← 1 2 3 4 5 →