Create an instance of the interface class. It contains only global internal data shared by all LP
problems, so you will not usually need multiple instances of solver in your program.
Nor they would disturb each other.
Find the convex hull of the given point set. Points must contain
homogeneous coordinates of the points; the elements in the first column
must be 1 for affine points and 0 for rays.
Return value:
first the facet normals
second the linearity basis (the subspace orthogonal to Points).
Dual convex hull problem: find the vertices of a polyhedron given as an intersection of halfspaces
(Inequalities∗X>=0) and hyperplanes (Equations∗X=0).
Separate the extremal vertices from the redundant points in a given point set.
Points must contain homogeneous coordinates.
This operation is cheaper than the complete convex hull computation, as it is based on repeating LP solving.
Return value:
first the vertex indices.
second (in lrs_interface::solver) the linearity basis (the subspace orthogonal to Points)
second (in cdd_interface::solver) the co-vertices, that is,
normal vectors of hyperplanes separating the corresponding vertex from the rest.