Gray codes for non-crossing partitions and dissections of a convex polygon

In this paper we develop Gray codes for two families of geometric objects: non-crossing partitions and dissections of a convex polygon by means of non-crossing diagonals.