Main /

BackwardsCompatibility

Main.BackwardsCompatibility History

Hide minor edits - Show changes to markup

June 26, 2014, at 02:17 PM by mk -

Changed lines 41-43 from:

polytope/volume Polyhedron/volume

to:

`polytope/volume`	`Polyhedron/volume`
`mpt_removeOverlaps`	`PolyUnion/min`
`mpt_isPWAbigger`	`PolyUnion/compare`

Restore

January 15, 2014, at 07:16 PM by 91.127.128.140 -

Changed line 1 from:

In general, MPT3 is *NOT* compatible with MPT2. However, MPT3 contains a thin compatibility layer, which maps methods of the polytope object of MPT2 onto corresponding methods of the Polyhedron object in MPT3.

to:

In general, MPT3 is NOT compatible with MPT2. However, MPT3 contains a thin compatibility layer, which maps methods of the polytope object of MPT2 onto corresponding methods of the Polyhedron object in MPT3.

Restore

January 10, 2014, at 03:52 PM by 188.167.109.37 -

Changed line 9 from:

polytope/dimension Polyhedron/Dim

to:

polytope/dimension Polyhedron.Dim

Changed line 13 from:

polytope/eq (P==Q) Polyhedron/eq

to:

polytope/eq (P==Q) Polyhedron/eq or P==Q

Changed lines 16-18 from:

`polytope/ge` (`P>=Q`)	`Polyhedron/ge`
`polytope/hull`	`Polyhedron/convexHull`
`polytope/intersect`	`Polyhedron/intersect`

to:

`polytope/ge` (`P>=Q`)	`Polyhedron/ge` or `P>=Q`
`polytope/hull`	`Polyhedron(V)`
`polytope/intersect`	`Polyhedron/intersect` or `P & Q`

Changed line 24 from:

polytope/le (P<=Q) Polyhedron/le

to:

polytope/le (P<=Q) Polyhedron/le or (P<=Q)

Changed line 33 from:

polytope/plus (P+Q) Polyhedron/plus

to:

polytope/plus (P+Q) Polyhedron/plus or P+Q

Restore

January 10, 2014, at 02:35 PM by 147.175.64.200 -

Changed line 36 from:

polytope/reduce Polyhedron/convexHull

to:

polytope/reduce Polyhedron/minHRep

Restore

January 10, 2014, at 02:33 PM by 147.175.64.200 -

Changed line 12 from:

polytope/double Polyhedron.H

to:

polytope/double Polyhedron.H, Polyhedron.A, Polyhedron.b

Changed line 14 from:

polytope/extreme Polyhedron.V

to:

polytope/extreme Polyhedron.V, Polyhedron.R

Restore

January 10, 2014, at 02:33 PM by 147.175.64.200 -

Changed line 12 from:

polytope/double Polyhedron/H

to:

polytope/double Polyhedron.H

Changed line 14 from:

polytope/extreme Polyhedron/extreme

to:

polytope/extreme Polyhedron.V

Restore

November 01, 2013, at 07:13 PM by mk -

Changed line 22 from:

polytope/isinside Polyhedron/contains, Polyhedron/isInside

to:

polytope/isinside Polyhedron/contains

Restore

May 23, 2013, at 08:03 PM by Michal Kvasnica -

Added lines 1-41:

In short, this layer allows most (if not all) custom algorithms to just work with MPT3. If you find that some methods misbehaves, or was not implemented in the compatibility layer, please let us know.

MPT2 function	Equivalent in MPT3
`polytope`	`Polyhedron`
`polytope/bounding_box`	`Polyhedron/outerApprox`
`polytope/chebyball`	`Polyhedron/chebyCenter`
`polytope/dimension`	`Polyhedron/Dim`
`polytope/distance`	`Polyhedron/distance`
`polytope/domain`	`Polyhedron/invAffineMap`
`polytope/double`	`Polyhedron/H`
`polytope/eq` (`P==Q`)	`Polyhedron/eq`
`polytope/extreme`	`Polyhedron/extreme`
`polytope/facetcircle`	`Polyhedron/getFacet`, `Polyhedron/chebyCenter`
`polytope/ge` (`P>=Q`)	`Polyhedron/ge`
`polytope/hull`	`Polyhedron/convexHull`
`polytope/intersect`	`Polyhedron/intersect`
`polytope/isbounded`	`Polyhedron/isBounded`
`polytope/isconvex`	`PolyUnion/isConvex`
`polytope/isfulldim`	`Polyhedron/isFullDim`, `Polyhedron/isEmptySet`
`polytope/isinside`	`Polyhedron/contains`, `Polyhedron/isInside`
`polytope/isminrep`	`Polyhedron/irredundantHRep`
`polytope/le` (`P<=Q`)	`Polyhedron/le`
`polytope/merge`	`PolyUnion/merge`
`polytope/minus` (`P-Q`)	`Polyhedron/minus`
`polytope/mldivide` (`P\Q`)	`Polyhedron/mldivide`
`polytope/mtimes` (`P*Q`)	`Polyhedron/mtimes`, `Polyhedron/affineMap`
`polytope/nconstr`	`size([Polyhedron.H; Polyhedron.He], 1)`
`polytope/ne` (`P~=Q`)	`Polyhedron/ne`
`polytope/normalize`	`Polyhedron/normalize`
`polytope/plot`	`Polyhedron/plot`
`polytope/plus` (`P+Q`)	`Polyhedron/plus`
`polytope/projection`	`Polyhedron/projection`
`polytope/range`	`Polyhedron/affineMap`
`polytope/reduce`	`Polyhedron/convexHull`
`polytope/regiondiff`	`Polyhedron/mldivide` (`P\Q`)
`polytope/slice`	`Polyhedron/slice`
`polytope/triangulate`	`Polyhedron/triangulate`
`polytope/union`	`PolyUnion/isConvex`
`polytope/volume`	`Polyhedron/volume`

Restore