The reverse search technique has been recently introduced by the authors for efficient enumeration of vertices of polyhedra and arrangements. In this paper, the authors develop the idea in a broader framework and show its applications to various problems in operations research, combinatorics, and geometry.
In my talk, I will be discussing the motivations and details of reverse search, followed by a discussion of how it can be applied to the problem of generating all possible triangulations to a set of n points in the plane.