image thumbnail

updated 7 months ago

Representing Polyhedral Convex Hulls by Vertices or (In)Equalities by Matt J

Express bounded polyhedron via equalities/inequalities or vertices. (vert2con, polyhedron, polytope)

[A,b,Aeq,beq]=vert2lcon(V,tol)

[V,nr,nre]=lcon2vert(A,b,Aeq,beq,TOL,checkbounds)

[varargout]=qlcon2vert(x0,varargin)

image thumbnail

updated 2 years ago

Uniform distribution over a convex polytope by Tim Benham

Samples uniformly the interior of a convex polytope. (polytope, random, uniform)

chebycenter(A,b)

cprnd(N,A,b,options)

image thumbnail

updated 2 years ago

Chebyshev Center and Radius by Tim Benham

Computes the Chebyshev center and Chebyshev radius of a polytope. (polytope, polyhedron, chebyshev center)

chebycenter(A,b)

image thumbnail

updated 2 years ago

Analytic Center by Tim Benham

Computes the analytic center of a set of linear equations. (polytope, linear equations, analytic center)

ancenter(A,b)

image thumbnail

updated 5 years ago

Polytopes by Bill McKeeman

Display regular and semi regular geometric figures. (gallery, ndimensional, polygon)

N-D Geometrical Figures

angles(e)

buckytumble

image thumbnail

updated 9 years ago

VERT2CON - vertices to constraints by Michael Kleder

Create inequality constraints to bound the convex hull of the given points. (optimization, polygon, polyhedron)

vert2con(V)

image thumbnail

updated 9 years ago

CON2VERT - constraints to vertices by Michael Kleder

Convert convex constraint inequalities into a set of vertices; i.e., polygon "vertex enumeration." (optimization, vertex, enumeration)

con2vert(A,b)

Contact us