On the number of visibility graphs of simple polygons

We present upper and lower bounds for the number of labelled visibility graphs of simple polygons of n vertices. The lower bound is roughly in the order of O(n2n) and the upper bound is O(n3n).