Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem

@article{Crass1995SearchingFA,
  title={Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem},
  author={D. Crass and Ichiro Suzuki and Masafumi Yamashita},
  journal={Int. J. Comput. Geometry Appl.},
  year={1995},
  volume={5},
  pages={397-412}
}
The polygon search problem is the problem of searching for mobile intruders in a simple polygon by a single mobile searcher having various degrees of visibility. This paper considers the "open edge" variant of the problem in which the given polygon P must be searched without allowing undetected intruders to reach a given edge u, under an additional assumption that any number of intruders can leave and enter P through another edge v at any time. One may view P as representing a corridor with two… CONTINUE READING
39 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Polygon visibility algorithms for weak visibility and link distance problems

  • Y. Ke
  • Ph.D. Dissertation, Department of Computer…
  • 1989
3 Excerpts

Art Gallery Theorems and Algorithms

  • J. O'Rourke
  • 1987
1 Excerpt

Minimum link paths in polygons and related problems

  • S. Suri
  • Ph.D. Dissertation, Department of Computer…
  • 1987
3 Excerpts

Similar Papers

Loading similar papers…