Analyze N-dimensional Convex Polyhedra

Find vertex or (in)equality forms of convex polyhedra in R^n (for n not super large). Also, compute their intersections and unions.

Download
Download

You are now following this Submission

Cite As

Matt J (2026). Analyze N-dimensional Convex Polyhedra (https://au.mathworks.com/matlabcentral/fileexchange/30892-analyze-n-dimensional-convex-polyhedra), MATLAB Central File Exchange. Retrieved .

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
1.9.0

Edited descriptive text

Download
1.9.0-1

Editing of descriptive text only.

Download
1.9.0-0

Bug fix - the case where the equality constraint system Aeq*x=beq had a unique solution was not handled properly

Download
1.8.0

Minor grammatical and spelling edits to description page.

Download
1.7.0

added screenshot

Download
1.6.0

* improved error checking in lcon2vert
* some improved/faster search criteria added to lcon2vert.
* added qlcon2vert, a faster version of lcon2vert which skips certain checks and precomputations

Download
1.5.0

If lcon2vert fails to find an initial interior point after many iterations of the alg it uses, it will now quit with V=[].

Download
1.4.0

Various bug fixes and improvements in robustness. These address failure cases discovered recently by users.

Download
1.3.0

*Further robustness of lcon2vert
*Improved weeding of non-unique constraints in vert2lcon output
*Outputs A,Aeq of vert2lcon will now have normalized rows.

Download
1.2.0

Improved the reliability of CON2VERT subroutine, both in terms of performance and of error reporting.

Download
1.1.0

added LCON2VERT which does the inverse of VERT2CON

Download
1.0.0

Download