|References to cite
As written in the user guide of lrs:
A polyhedron can be described by a list of inequalities (H-representation) or as by a list of its vertices and extreme rays (V-representation). lrs is a C program that converts a H-representation of a polyhedron to its V-representation, and vice versa. These problems are known respectively at the vertex enumeration and convex hull problems.
I have forked lrs to add a few functions to help doing the wrapper. These changes are not upstream yet so this version is used instead of the upstream version.