The Path of a Triangulation

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-andconquer 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.

• Type: Conference
• Year: 1999
• Where: COMPGEOM
• Authors: Oswin Aichholzer
• Keywords: COMPGEOM 1999, Data Structure, Discrete Geometry, Divide-andconquer Type, Generalizing