P157: Enumeration of all floorplans with exactly $n$ faces

P157: Enumeration of all floorplans with exactly $n$ faces

Input:

An integer $n$.

Output:

All floorplans with exactly $n$ faces.

Complexity:

$O(1)$ time per solution with $O(n)$ space.

Comment:

A planar graph is called a \textit{floorplan} if every face is a rectangle.

Reference:

[Nakano2001a] (Bibtex)