본문 바로가기
  • Home

A Simple Polygon Search Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(5), pp.41-47
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper considers simple polygon search problem. How many searchers find a mobile intruder that is arbitrarily faster than the searcher within polygon art gallery? This paper uses the visibility graph that is connected with edges for mutually visible vertices. Given visibility graph, we select vertex  that is conjunction   in   for   ≤ . We decide 1-searchable if  ≤ ≤  and 2-searchable if ≥ . We also present searcher's shortest path. This algorithm is verified by varies 1 or 2-searchable polygons.

Citation status

* References for papers published after 2022 are currently being built.