I will talk about the paper of Zhu, Sundaram, Snoeyink and Mitchell
(Computational Geometry 6 (1996) 277-290) in which they show how to
generate monotone polygons from a given set of n vertices uniformly
at random (i.e. every monotone polygon on these vertices is equally
likely).