Simple algorithms for searching a polygon with flashlights
- 16 March 2002
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 81 (5) , 265-270
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHERInternational Journal of Computational Geometry & Applications, 2000
- A VISIBILITY-BASED PURSUIT-EVASION PROBLEMInternational Journal of Computational Geometry & Applications, 1999
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEMInternational Journal of Computational Geometry & Applications, 1995
- Searching for a Mobile Intruder in a Polygonal RegionSIAM Journal on Computing, 1992
- THE TWO GUARDS PROBLEMInternational Journal of Computational Geometry & Applications, 1992
- On some link distance problems in a simple polygonIEEE Transactions on Robotics and Automation, 1990
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987