An efficient algorithm for the three-guard problem-Reference-Cited by-同舟云学术

An efficient algorithm for the three-guard problem

Published:2008-10 Issue:17 Volume:156 Page:3312-3324
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Tan Xuehou

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Characterizing LR-visibility polygons and related problems;Bhattacharya;Comput. Geom., Theory Appl.,2001

2. Optimal algorithms for two-guard walkability of simple polygons;Bhattacharya;Lect. Notes Comput. Sci.,2001

3. Visibility and intersection problems in plane geometry;Chazelle;Discrete Comput. Geom.,1989

4. Searching for a mobile intruder in a corridor;Crass;Internat J. Comput. Geom. Appl.,1995

5. A. Efrat, L.J. Guibas, S. Har-Peled, D.C. Lin, J.S.B. Mitchell, T.M. Murali, Sweeping simple polygons with a chain of guards, in: Proc., ACM-SIAM SODA, 2000, pp. 927–936

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

1. Characterizing Link-2 LR-Visibility Polygons and Related Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-02-01

2. Minimization of the maximum distance between the two guards patrolling a polygonal region;Theoretical Computer Science;2014-05

3. Characterizing and recognizing LR-visibility polygons;Discrete Applied Mathematics;2014-03

4. Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2012

5. Searching a Polygonal Region by a Boundary Searcher;Journal of Computer Science and Technology;2009-05