AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES

被引：30

作者：

Tan, Xuehou ^{[1
]}

Hirata, Tomio ^{[2
]}

Inagaki, Yasuyoshi ^{[2
]}

机构：

[1] Tokai Univ, Sch High Technol Human Welf, Numazu 41003, Japan

[2] Nagoya Univ, Fac Engn, Chikusa Ku, Nagoya, Aichi 464, Japan

来源：

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1993年 / 3卷 / 04期

关键词：

Algorithms; computational geometry; watchman routes; essential cuts;

D O I：

10.1142/S0218195993000233

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The problem of finding the shortest watchman route in a simple polygon P through a point s on its boundary is considered. A route is a watchman route if every point inside P can be seen from at least one point along the route. We present an incremental algorithm that constructs the shortest watchman route in O(n(3)) time for a simple polygon with n edges. This improves the previous O(n(4)) bound.

引用

页码：351 / 365

页数：15

共 50 条

[1] AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
TAN, XH
HIRATA, T
INAGAKI, Y
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 163 - 175
[2] An incremental algorithm for constructing shortest watchman routes (vol 3, pg 351, 1993)
Tan, XH
Hirata, T
Inagaki, Y
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1999, 9 (03) : 319 - 323
[3] SHORTEST WATCHMAN ROUTES IN SIMPLE POLYGONS
CHIN, WP
NTAFOS, S
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (01) : 9 - 31
[4] Fast computation of shortest watchman routes in simple polygons
Tan, XH
[J]. INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 27 - 33
[5] Improvement of a shortest routes algorithm
Lassabe, Nicolas
Berro, Alain
Duthen, Yves
[J]. 2007 IEEE INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE, VOLS 1 AND 2, 2007, : 1044 - 1048
[6] An improved algorithm for computing a shortest watchman route for lines
Tan, Xuehou
Jiang, Bo
[J]. INFORMATION PROCESSING LETTERS, 2018, 131 : 51 - 54
[7] AN INCREMENTAL ALGORITHM FOR IDENTIFICATION OF LONGEST (SHORTEST) PATHS
KUNDU, S
[J]. INTEGRATION-THE VLSI JOURNAL, 1994, 17 (01) : 25 - 31
[8] Observation routes and external watchman routes
Dumitrescu, Adrian
Toth, Csaba D.
[J]. THEORETICAL COMPUTER SCIENCE, 2024, 1019
[9] Approximating Watchman Routes
Mitchell, Joseph S. B.
[J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 844 - 855
[10] OPTIMUM WATCHMAN ROUTES
CHIN, WP
NTAFOS, S
[J]. INFORMATION PROCESSING LETTERS, 1988, 28 (01) : 39 - 44

← 1 2 3 4 5 →