#include <lrs_interface.h>
    

An interface to the lrslib library, implementing the main LP and convex hull computations with exact arithmetic.

This class and all related types are defined in the namespace lrs_interface. The namespace prefix is omitted in the descriptions below for the sake of compactness; you must nevertheless specify it explicitly in your applications, or import it with the using namespace directive.

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.

Returns the facet normals in first, and the basis of the subspace orthogonal to Points in second.

Dual convex hull problem: find the vertices of a polyhedron given as an intersection of halfspaces (Inequalities∗X>=0) and hyperplanes (Equations∗=0).

Returns the homogeneous coordinates of the vertices.

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.

Returns the vertex indices in first, and the basis of the subspace orthogonal to Points in second.

Find an arbitrary vertex for which Inequalities∗X>=0 and Equations∗=0 hold. Returns the homogeneous coordinates.

The same as above, but the infeasible case is reported using the boolean first member of the return value, instead of raising an exception.

Solve the linear programming problem Objective∗X→max (min if maximize==false) subject to Inequalities∗X>=0 and Equations∗X=0.

Returns the objective function value in first, the extremal vertex in second.