Before revision:  We also give an upper bound of O(log^2 n) colours on weak-visibility polygonswhich generalizes to all simple polygons.
After revision:  We also give an upper bound of O(log^2 n) colours on n-vertex weak visibility polygons, by decomposing the problem into sub-funnels. This bound generalises to all simple polygons.