Geometry / Vertex (Bibtex)

P467: Enumeration of all vertices in a convex polyhedral set

Input:

A convex polyhedral set $P$.

Output:

All vertices of $P$.

Complexity:

Comment:

Reference:

[Balinski1961] (Bibtex)

P450: Enumerate all vertices of a convex polyhedron

Input:

A convex polyhedron $X$

Output:

All vertices of $X$.

Complexity:

Comment:

They use a linear programming.

Reference:

[Manas1968] (Bibtex)

P479: Enumeration of all vertex of a convex polytope

Input:

$m$ linear inequalities in $n$ varibles.

Output:

All vertices of a convex polytope that represented by the inequalities.

Complexity:

Comment:

Reference:

[Mattheiss1973] (Bibtex)

P481: Enumeration of all vertex of a convex polyhedron

Input:

$m$ inequalities with $n$ variables.

Output:

All vertex of a convex polyhedron represented by the given inequalities.

Complexity:

Comment:

Reference:

[Altherr1975] (Bibtex)