P279: Enumeration of all pseudotriangulations of a finite point set

P279: Enumeration of all pseudotriangulations of a finite point set

Input:

A point set $S$ of size $n$.

Output:

All pointed pseudotriangulations of $S$.

Complexity:

$O(\log n)$ time per solution with linear space.

Comment:

Reference:

[Bereg2005] (Bibtex)