Before revision:  We also give an upper bound of O(log  n) colours on weak-visibility polygons which generalizes to all simple polygons.
After revision:  We also give an upper bound of O(log ^2 n) colours on weak-visibility polygons which generalizes to all simple polygons.