Watchman routes in the presence of a pair of convex polygons-Reference-Cited by-同舟云学术

Watchman routes in the presence of a pair of convex polygons

Published:1998-03 Issue:1-4 Volume:105 Page:123-149
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Gewali Laxmi P.,Ntafos Simeon

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference19 articles.

1. J. Bhadury, V. Chandru, A. Maheshwari, R. Chandrasekaran, Art Gallery Problems for Convex Nested Polygons, INFORMS Journal of Computing (to appear).

2. Art Gallery Theorems and Algorithms;O'Rourke,1987

3. An incremental Algorithm for Constructing Shortest Watchman Routes;Tan,1991

4. An Algorithm for Planning Collision-free Paths Among Polyhedral Obstacles;Lozano-Perez;Communications of the ACM,1979

5. The Aquarium Keeper's Problem;Czyzowicz,1991

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

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

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

3. Monotone Paths with Visibility Properties;2017 25th International Conference on Systems Engineering (ICSEng);2017-08

4. On the complexity of approximating tsp with neighborhoods and related problems;computational complexity;2006-03

5. Determining Setup Orientations From the Visibility of Slice Geometry for Rapid Computer Numerically Controlled Machining;Journal of Manufacturing Science and Engineering;2005-03-15