 Contents | Multi-Parametric Toolbox Polytope library |
| analyticCenter | ANALYTICCENTER Computes an analytic center of a polytope |
| and | AND Intersection of n polytopes |
| bounding_box | BOUNDING_BOX Compute a bounding box for a given polytope |
| chebyball | CHEBYBALL Computes center and radius of the largest ball inscribed in a polytope |
| dimension | DIMENSION Returns dimension of the given polytope |
| display | DISPLAY Displays details about the given polytope |
| distance | DISTANCE Distance between two sets |
| distribpoints | DISTRIBPOINTS Distribute n points such that distances between them are maximized |
| dointersect | DOINTERSECT Checks if two polytopes / polyarrays intersect |
| domain | DOMAIN Computes polytope that is mapped to an another polytope using affine map |
| double | DOUBLE Function used to access internal properties of the given polytope |
| end | END Returns the last element in a given polytope array |
| envelope | ENVELOPE Computes envelope of n polytopes |
| eq | EQ Checks if two polytopes are equal |
| extreme | EXTREME Calculates extreme points of a given polytope |
| facetcircle | FACETCIRCLE Returns largest circle inside facet 'ind' of polytope P |
| facetvoronoi | FACETVORONOI Computes an equivalent of voronoi diagrams for facets |
| fliplr | FLIPLR Flips array of polytopes |
| flipud | FLIPUD Flips array of polytopes |
| ge | GE Checks if polytope P is a superset of polytope Q |
| get | GET Get polytope properties |
| getInnerEllipsoid | GETINNERELLIPSOID Computes the largest ellipsoid inscribed in a polytope |
| getOutterEllipsoid | GETOUTTERELLIPSOID Computes the smallest ellipsoid which covers the polytope P |
| gt | GT Checks if polytope P is a strict superset of polytope Q |
| horzcat | HORZCAT Concatenates polytopes into a polytope array |
| hull | HULL Convex hull of n polytopes |
| intersect | INTERSECT Intersection of 2 polytopes or polytope arrays |
| isbounded | ISBOUNDED Checks if a polytope is bounded |
| isconvex | ISCONVEX Checks if a polytope array forms a convex union |
| isfulldim | ISFULLDIM Checks if a polytope is full dimensional |
| isinside | ISINSIDE Checks if a given point lies in the interior of a given polytope |
| isminrep | ISMINREP Checks if a given polytope is in minimal representation |
| isnormal | ISNORMAL Checks if a given polytope is in normalized description |
| isredundant | ISREDUNDANT Check if a constraint is redundant |
| le | LE Checks if polytope P is a subset of polytope Q |
| length | LENGTH Returns number of elements in a polytope array |
| loadobj | LOADOBJ load filter for POLYTOPE objects. |
| lt | LT Checks if polytope P is a strict subset of polytope Q |
| merge | MERGE merges polytopes together |
| minus | MINUS Pontryagin difference |
| mldivide | MLDIVIDE Set difference |
| mtimes | MTIMES Polytope multiplication |
| nconstr | NCONSTR Returns number of constraints that form an H-representation of a polytope |
| ne | NE Checks if two polytopes are not equal |
| normalize | NORMALIZE Normalizes a given polytope |
| or | OR Convex union of n polytopes |
| pelemfun | PELEMFUN Execute the specified function on each element of a polytope array |
| plot | PLOT Plots polytopes in 2D or 3D |
| plus | PLUS Minkowski sum of two polytopes |
| polytope | POLYTOPE Default constructor for the POLYTOPE object |
| projection | PROJECTION Projection of a polytope or a polytope array |
| range | RANGE Affine transformation of a polytope |
| reduce | REDUCE Reduces the polytope by removing redundant inequalities |
| reduceunion | REDUCEUNION Removes redundant elements from a polytope array |
| regiondiff | REGIONDIFF Region difference |
| regiondiffXU | REGIONDIFFXU Computes region difference in lifted XU space |
| set | SET Used to modify internal properties of a given polytope object |
| size | SIZE Returns size of the given polytope object |
| slice | SLICE cuts a polytope (polytope array) at prespecified values |
| subsasgn | SUBSASGN Indexed assignments for polytope objects |
| subsref | SUBSREF Indexed referencing for polytope objects |
| triangulate | TRIANGULATE Calculates triangulation of arbitrary polytopes |
| uminus | UMINUS Unary minus for a polytope |
| union | UNION convex union computation |
| unique | UNIQUE Removes redundant entries from a polytope array |
| uplus | UPLUS Unary plus for a polytope |
| vertcat | VERTCAT Concatenates polytopes into a polytope array |
| volume | VOLUME Calculates volume of a polytope |
Master index