The Number of Pointed Pseudotriangulations
For a planar point set , is the number of pointed pseudotriangulations always at least the number of triangulations?
A pseudotriangle is a planar polygon with exactly three convex vertices. Each pair of convex vertices is connected by a reflex chain, which may be just one segment. (Thus, a triangle is a pseudotriangle.) A pseudotriangulation of a set of points in the plane is a partition of the convex hull of into pseudotriangles using as a vertex set. A minimum pseudotriangulation, or pointed pseudotriangulation, has the fewest possible number of edges for a given set of points.
See [Streinu, 2000], [Kettner et al., 2003], [O'Rourke, 2002] for examples, explanation of the term \textquotedblleft{}pointed,\textquotedblright{} and further details.
