Overview of the PolyhedralSets Package
DescriptionList of PolyhedralSets Package CommandsList of PolyhedralSets SubpackagesAccessing the PolyhedralSets Package CommandsCompatibility
<Text-field style="Heading 2" layout="Heading 2" bookmark="info">Description</Text-field>
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.
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk0">List of PolyhedralSets Package Commands</Text-field>
Creating polyhedral sets
Standard constructor
PolyhedralSet
Three dimensional example sets
CubeOctahedronTetrahedronTruncatedTetrahedronTruncatedOctahedronCuboctahedron
Example sets of arbitrary dimension
HypercubeSimplexRandomSolidRandomSetUniversalSetEmptySetHyperoctant
Visualizing sets
PlotGraphDisplayPrintLevel
Set operators
intersectsubsetinEqual
Calculating related sets
FacesFacetsVerticesEdgesDualSetSplitIntoSimplicesAffineHullCharacteristicConeConvexHullLinearitySpace
Properties of a Set
CoordinatesRelationsVerticesAndRaysInteriorPointDimensionIsBoundedIsEmptyIsUniversalSetIsFaceIsInInteriorLocatePointIDVolumeAreaLength
Transforming Sets
LinearTransformationProjectTranslate
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk1">List of PolyhedralSets Subpackages</Text-field>
The ExampleSets subpackage provides a collection of examples that can be used with commands in the PolyhedralSets package.CubeCuboctahedronEmptySetHypercubeHyperoctantOctahedronRandomSetRandomSolidSimplexTetrahedronTruncatedOctahedronTruncatedTetrahedronUniversalSet
<Text-field style="Heading 2" layout="Heading 2" bookmark="bkmrk2">Accessing the PolyhedralSets Package Commands</Text-field>
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.
<Text-field style="Heading 2" layout="Heading 2" bookmark="compatibility">Compatibility</Text-field>
The PolyhedralSets package was introduced in Maple 2015.
For more information on Maple 2015 changes, see Updates in Maple 2015.See AlsoRegularChains[SemiAlgebraicSetTools][LinearSolve]geometrygeom3dsimplex