A linear-time 2-approximation algorithm for the watchman route problem for simple polygons-Reference-Cited by-同舟云学术

A linear-time 2-approximation algorithm for the watchman route problem for simple polygons

Published:2007-09 Issue:1 Volume:384 Page:92-103
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Tan Xuehou

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Finding an approximate minimum-link visibility path inside a simple polygon;Alsuwaiyel;Inform. Process. Lett.,1995

2. Characterizing LR-visibility polygons and related problems;Bhattacharya;Comput. Geom.,2001

3. S. Carlsson, H. Jonsson, B.J. Nilsson, Approximating the shortest watchman route in a simple polygon, Technical Report, Department of Computer Science, Lund University, Sweden, 1997

4. Finding the shortest watchman route in a simple polygon;Carlsson;Discrete Comput. Geom.,1999

5. Visibility and intersection problem in plane geometry;Chazelle;Discrete Comput. Geom.,1989

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Observation routes and external watchman routes;Theoretical Computer Science;2024-12

2. Approximation Algorithms for the Two-Watchman Route in a Simple Polygon;Algorithmica;2024-06-19

3. Minimizing Turns in Watchman Robot Navigation: Strategies and Solutions;2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE);2023-07-24

4. A sufficient condition for visibility paths in simple polygons;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-19

5. Observation Routes and External Watchman Routes;Lecture Notes in Computer Science;2023