Representing Polyhedral Convex Hulls by Vertices or (In)Equalities 1.0

This submission contains VERT2LCON and LCON2VERT, which will find the linear constraints defining a bounded polyhedron in R^n, given its vertices, or vice versa. They are extensions of Michael Kleder's VERT2CON and CON2VERT functions that can handle cases where the polyhedron is not solid in R^n, i.e., where the polyhedron is defined by both equality and inequality constraints. Some other refinements to the original VERT2CON and CON2VERT subroutines, meant to improve speed and reliability, have also been made. SYNTAX: [A,b,Aeq,beq]=VERT2LCON(V,TOL) [V,nr,nre]=LCON2VERT(A,b,Aeq,beq,TOL) The rows of the N x n matrix V are a series of N vertices of the polyhedronin R^n, defined by the linear constraints A*x =0, y>=0, z>=0. >> [A,b,Aeq,beq]=vert2lcon(eye(3)) A = 0.4082 -0.8165 0.4082 0.4082 0.4082 -0.8165 -0.8165 0.4082 0.4082 b = 0.4082 0.4082 0.4082 Aeq = 0.5774 0.5774 0.5774 beq = 0.5774And the reverse conversion is, >> V=lcon2vert(A,b,Aeq,beq) V = 1.0000 0.0000 0.0000 -0.0000 1.0000 0 0 0.0000 1.0000

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Argument,  Finite,  Issues,  Nonredundant,  Optional,  Precision,  Purposes,  Quotnrequot,  Rankestimation,  Tolerance
Users rating:	0/10