P265: Enumeration of all pseudotriangulations of a point set

P265: Enumeration of all pseudotriangulations of a point set

Input:

A point set $P$.

Output:

All pseudotriangulations of $P$.

Complexity:

$O(n)$ time per pseudotriangulation.

Comment:

$n$ is the number of points in $P$.

Reference:

[Bronnimann2006a] (Bibtex)