P62: Enumeration of all vertex-defining of a plane

P62: Enumeration of all vertex-defining of a plane

Input:

Output:

Complexity:

$O(m^2 T(m,n)f)$ total time and $O(S(m, n))$ space.

Comment:

$f$ is the number of output, and $T(m, n)$ and $S(m, n)$ are time and space complexity needed to solve RVP.

Reference:

[Fukuda1997] (Bibtex)