|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
We took from the Cdd library the following ideas: matrices rows are lexicographically sorted (lazily, as for conversion). This presents two advantages: fukuda96 observed that it speeds conversion of representation. In addition when we merge constraints of two polyhedra in intersection operations, this allows us to remove identical constraints easily.