[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |

Saturation matrices allows the user to know which generator saturates which constraint, i.e. their scalar product is zero. This means that the generator belongs to the constraint. Such matrices are obtained from polyhedra (see next section) in two versions: either columns are indexed by constraints and rows by generator, either the opposite. A cleared bit indicates saturation, and bit set to one indicates that the generator only satisfies the constraint.

The type satmat_t Basic Operations on saturation matrices Bit manipulations on saturation matrices Matrix manipulations on saturation matrices

This document was generated on