P170: Enumeration of all biconnected plane triangulations with $n$ vertices and $r$ vertices on the outer faces

P170: Enumeration of all biconnected plane triangulations with $n$ vertices and $r$ vertices on the outer faces

Input:

Integers $n$ and $r$.

Output:

All biconnected plane triangulations with $n$ vertices and $r$ vertices on the outer faces.

Complexity:

$O(rn)$ time per triangulation and $O(n)$ space.

Comment:

Reference:

[Nakano2004b] (Bibtex)