P145: Enumeration of all biconnected based plane triangulations with $n$ vertices and $r$ vertices on the outer face
P145: Enumeration of all biconnected based plane triangulations with $n$ vertices and $r$ vertices on the outer face
Input:
Integers $n$ and $r$.
Output:
All biconnected based plane triangulations with $n$ vertices and $r$ vertices on the outer face.
Complexity:
$O(1)$ time per based plane triangulation with $O(n)$ space.
Comment:
A \textit{based plane triangulation} is a plane triangulation with one designated edge on the outer face. The algorithm does not output entire solution but output the difference from the previous solution.