Inhull by John D'Errico

Efficient test for points inside a convex hull in n dimensions (convex hull, inhull, hull)

inhull(testpts,xyz,tess,tol)

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

Express bounded polyhedron via equalities/inequalities or vertices. (convex analysis, optimization, polytope)

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

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

Interest rate model by Sandeep

Hull and White interest rate model (finance, modeling, analysis)

hullwhite.m

VERT2CON - vertices to constraints by Michael Kleder

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

vert2con(V)

hullfit by Peter Wasmeier

Fit polygon hull to a data set better than convhull would do. (hull, convhull, area)

k=hullfit(x,y,p,fh)