Predicates on polyhedra

Function: bool poly_is_minimal (const poly_t* po)

Says if the polyhedron is minimized. Doesn't imply any computation.

Function: bool poly_is_empty (const poly_t* po)

Tests if the polyedron is empty. Can imply minimization.

Function: bool poly_is_universe (const poly_t* po)

Tests if the polyhedron is the universe one. Imply minimization.

Function: tbool poly_is_empty_lazy (const poly_t* po)

This function tests emptiness without minimize the polyhedron. As a result, the answer can be: I don't know (tbool_bottom).

Function: tbool poly_versus_constraint (const poly_t* po,const pkint_t* tab)

Tests the relation between the polyhedron and the constraint, which must have the same dimension. If the constraint is an inequality the result has the following meaning:

• tbool_top: all frames belongs to the hyperplane defined by the constraint;
• tbool_true: all frames satisfies the constraint but do not verify the preceding property (the polyhedron is on the positive side of the constraint);
• tbool_false: no frame satisfies the constraint (the polyhedron is on the strictly negative side of the constraint);
• tbool_bottom: the constraint splits the polyhedron.

In the case where the constraint is an equality, the two possible results are tbool_top and tbool_bottom.

Function: bool poly_is_generator_included_in (const pkint_t* tab, const poly_t* po)

Tests if a generator is included in the polyhedron. The function may minimize the polyhedron in order to get its constraints.

Function: bool poly_is_included_in (const poly_t* pa, const poly_t* pb)

Tests the inclusion of the first polyhedron in the second one. This function may minimize the two polyhedra.

Function: bool poly_is_equal (const poly_t* pa, const poly_t* pb)

Tests the equality of two polyhedra. Requires minimal form for both polyhedra.