A watchman route is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study watchman routes outside a convex polygon, i.e., in R^2\O, where O^2\setminus \Omega, where \Omega } is a convex polygon  . We study the problem of a watchman route in an online setting, i.e., in a setting where the watchman is only aware of the vertices of the polygonto which it had a direct line of sight along its route. We present an algorithm guaranteeing a ~89.83 competitive ratio relative to the optimal offline path length .
A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in \mathbb{R^2\setminus \Omega, where \Omega } is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon . We prove that the presented algorithms guarantees a \approx 22.77 competitive ratio compared to the optimal offline watchman path .
R
route
path
R
watchman routes
the online watchman path problem
R
R^2\O, where O
\mathbb{R
A
that is not known in advance. We present an algorithm for the exploration of the region outside the polygon
R
study the problem of a watchman route in an online setting, i.e., in a setting where the watchman is only aware of the vertices of the polygonto which it had a direct line of sight along its route. We present an algorithm guaranteeing a ~89.83 competitive ratio relative
prove that the presented algorithms guarantees a \approx 22.77 competitive ratio compared
R
path length
watchman path