OPTIMUM WATCHMAN ROUTES

被引：92
|
作者：
CHIN, WP
NTAFOS, S
机构：
来源：
INFORMATION PROCESSING LETTERS | 1988年 / 28卷 / 01期
关键词：
D O I：
10.1016/0020-0190(88)90141-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：39 / 44
页数：6
相关论文
共 50 条
  • [1] Observation routes and external watchman routes
    Dumitrescu, Adrian
    Toth, Csaba D.
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 1019
  • [2] 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
  • [3] Computing multiple watchman routes
    Packer, Eli
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2008, 5038 : 114 - 128
  • [4] SHORTEST WATCHMAN ROUTES IN SIMPLE POLYGONS
    CHIN, WP
    NTAFOS, S
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (01) : 9 - 31
  • [5] Watchman routes for lines and line segments
    Durnitrescu, Adrian
    Mitchell, Joseph S. B.
    Zylinski, Pawel
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2014, 47 (04): : 527 - 538
  • [6] AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
    TAN, XH
    HIRATA, T
    INAGAKI, Y
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 163 - 175
  • [7] Watchman routes in the presence of a pair of convex polygons
    Gewali, LP
    Ntafos, S
    [J]. INFORMATION SCIENCES, 1998, 105 (1-4) : 123 - 149
  • [8] AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
    Tan, Xuehou
    Hirata, Tomio
    Inagaki, Yasuyoshi
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1993, 3 (04) : 351 - 365
  • [9] Fast computation of shortest watchman routes in simple polygons
    Tan, XH
    [J]. INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 27 - 33
  • [10] STORAGE AND REGENERATION OF OPTIMUM ROUTES
    MICKLE, MH
    WANG, JC
    HOELZEMAN, RG
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1977, 8 (07) : 739 - 752
12345