@article{ART002109874},
author={Sang-Un, Lee},
title={A Simple Polygon Search Algorithm},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2016},
volume={21},
number={5},
pages={41-47}
TY - JOUR
AU - Sang-Un, Lee
TI - A Simple Polygon Search Algorithm
JO - Journal of The Korea Society of Computer and Information
PY - 2016
VL - 21
IS - 5
PB - The Korean Society Of Computer And Information
SP - 41
EP - 47
SN - 1598-849X
AB - 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.
KW - Polygon search problem;Searcher;Intruder;Searcher's path;Flashlight search schedule
DO -
UR -
ER -
Sang-Un, Lee. (2016). A Simple Polygon Search Algorithm. Journal of The Korea Society of Computer and Information, 21(5), 41-47.
Sang-Un, Lee. 2016, "A Simple Polygon Search Algorithm", Journal of The Korea Society of Computer and Information, vol.21, no.5 pp.41-47.
Sang-Un, Lee "A Simple Polygon Search Algorithm" Journal of The Korea Society of Computer and Information 21.5 pp.41-47 (2016) : 41.
Sang-Un, Lee. A Simple Polygon Search Algorithm. 2016; 21(5), 41-47.
Sang-Un, Lee. "A Simple Polygon Search Algorithm" Journal of The Korea Society of Computer and Information 21, no.5 (2016) : 41-47.
Sang-Un, Lee. A Simple Polygon Search Algorithm. Journal of The Korea Society of Computer and Information, 21(5), 41-47.
Sang-Un, Lee. A Simple Polygon Search Algorithm. Journal of The Korea Society of Computer and Information. 2016; 21(5) 41-47.
Sang-Un, Lee. A Simple Polygon Search Algorithm. 2016; 21(5), 41-47.
Sang-Un, Lee. "A Simple Polygon Search Algorithm" Journal of The Korea Society of Computer and Information 21, no.5 (2016) : 41-47.
