Polyhedral Sets can be created from a list of equalities and non-strict inequalities. Redundant relations are removed and the remaining relations are put into a canonical form that speeds up later operations.
| (1.1) |
Sets can also be created from a list of vertices and rays. The package automatically prunes the list of vertices and rays to capture only the extreme vertices and rays of the set.
| (1.2) |
The set is displayed as its H-Representation, but the conversion back to its V-Representation is simple.
| (1.3) |
The ExampleSets
subpackage streamlines the creation of common sets. See ExampleSets- NDimensions and ExampleSets- ThreeDimensions.
| (1.4) |