Shortest Watchman Tours in Weak Visibility Polygons.
Piyush Kumar, C. E. Veni Madhavan · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · 1993
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a starting point on the boundary of the polygon is proposed by W.P. Chin and S. Ntafos. The problem of finding the SWT in general polygons when the starting point is not specified is open. We develop an $O(n^{10})$ algorithm for the SWT problem in weak visibility polygons, with no assumption on the starting point.