[PPL-devel] test if polyhedron satisfies a constraint

[P M Hill]

On Thu, 18 Oct 2001, Elisa Ricci wrote:

> On Thu, 18 Oct 2001, P M Hill wrote:
>
> > Hi,
> >
> > BTW In Polyhedron.defs.hh, I found:
> >   //! Returns the relation between the generators of \p *this
> >   //! and the constraint \p con.
> >   GenSys_Con_Rel poly_satisfies_constraint(const Constraint& con);
> >
> > but I am not sure what this is for.
> >
>
> Hi,
>
> this method is uesd to verify if the generators of the polyhedron
> *this satisfy the constraint con.
>
> Returns:
>   - ALL_SATURATE if all generators belong to the hyper-plane
>     defined by con (saturate con),
>   - ALL_SATISFY if all generators satisfy con but do not
>     belong to the hyper-plane defined by con,
>   - NONE_SATISFIES if no generators satisfy con,
>   - SOME_SATISFY if one or more generators do not satisfy con.

Hi,

Which, if any of these flags mean that all points in
the polyhedron satisfy the constraint?
Also, I want to refer to a specific polyhedron.

ciao,
  Pat