P256: Enumeration of all plane and connected straight-line graphs on a given point set in the plane

P256: Enumeration of all plane and connected straight-line graphs on a given point set in the plane

Input:

A point set $P$ in the plane.

Output:

All plane and connected straight-line graphs on $P$.

Complexity:

$O(|P|\log|P|)$ time per solution.

Comment:

Use gray code.

Reference:

[Aichholzer2007] (Bibtex)