We discuss an efficient algorithm to generate random convex polygons. The algorithm is based on a proof by Pavel Valtr concerning the probability that a set of points chosen independently and uniformly at random in the unit square is in convex position.