O. Aichholzer, B. Speckmann, and I. Streinu
We define the path of a pseudo-triangulation, a data structure generalizing the
path of a triangulation of a point set. This structure allows us to use
divide-and-conquer type of approaches for suitable (i.e. decomposable)
problems on pseudo-triangulations. We illustrate this method by presenting a
novel algorithm that counts the number of pseudo-triangulations of a point
set.