P297: Enumeration of all triangulation paths of a point set

P297: Enumeration of all triangulation paths of a point set

Input:

A point set $P$.

Output:

All triangulation paths of $P$.

Complexity:

$O(N|P|^3\log |P|)$ time and $O(|P|)$ space.

Comment:

$N$ is the number of solutions.

Reference:

[Dumitrescu2001] (Bibtex)