P167: Enumeration of all rectangle drawings with $n$ faces

P167: Enumeration of all rectangle drawings with $n$ faces

Input:

An integer $n$.

Output:

All rectangle drawings with $n$ faces.

Complexity:

$O(n)$ time per drawing and space.

Comment:

Reference:

[Takagi2004] (Bibtex)