Overview - Maple Help

Overview of the PolyhedralSets Package

Description

 • A polyhedral set is a set of points bounded by linear constraints.  It can be represented as a system of linear equalities and non-strict inequalities (called its H-Representation) or as sum of the convex combination of a set of vertices and the conical combination of a set of rays (called its V-Representation).  This package provides commands for working with polyhedral sets whose relations or vertices and rays have rational coefficients.

List of PolyhedralSets Package Commands

Creating polyhedral sets

Standard constructor

Three dimensional example sets

Example sets of arbitrary dimension

Visualizing sets

Set operators

Calculating related sets

Properties of a Set

Transforming Sets

List of PolyhedralSets Subpackages

 • The ExampleSets subpackage provides a collection of examples that can be used with commands in the PolyhedralSets package.

Accessing the PolyhedralSets Package Commands

 • Each command in the PolyhedralSets package can be accessed by using either the long form or the short form of the command name in the command calling sequence.  For example, if p is a polyhedral set you can use either PolyhedralSets[IsBounded](p) or with(PolyhedralSets); then IsBounded(p).
 • Because the underlying implementation of the PolyhedralSets package is a module, it is possible to use the form PolyhedralSets:-command to access a command from the package. For more information, see Module Members.

Compatibility

 • The PolyhedralSets package was introduced in Maple 2015.