作者
Alon Efrat, Leonidas J Guibas, Sariel Har-Peled, David C Lin, Joseph SB Mitchell, TM Murali
发表日期
2000/2/1
图书
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
页码范围
927-936
简介
We consider the problem of locating a moving target using a group of guards cooperatively moving inside a simple polygon. Our guards always form a simple polygonal chain within the polygon such that consecutive guards along the chain are mutually visible. We develop algorithms that sweep such a chain of guards through a polygon to locate the target. Our two main results are the following:
引用总数
1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023115688168101077165333112221
学术搜索中的文章
A Efrat, LJ Guibas, S Har-Peled, DC Lin, JSB Mitchell… - Proceedings of the eleventh annual ACM-SIAM …, 2000