image thumbnail

updated 6 months ago

SLM - Shape Language Modeling by John D'Errico

Least squares spline modeling using shape primitives (spline, splines, cubic)

slm_tutorial

hermite2slm(harray)

lse(A,b,C,d,solverflag,weights)

image thumbnail

updated 10 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 1 year ago

Grid of points within a polygon by Sulimon Sattari

This function generates an array of points that lie within a given polygon (polygon, points, point)

polygrid( xv, yv, ppa)

image thumbnail

updated almost 3 years ago

Convex Lens Game by Krishna Lalith

Identify the Reflections using Convex Lens from Object to Image. (convex, concave, mirror)

ConvexLens(action)

Image_Board(ObjSize,ObjPos,ObjNat,hand)

Lens_Link(handy,varargin)

image thumbnail

updated 5 years ago

DFP quasi Newton method by Bapi Chatterjee

It solves an optimization problem by DFP quasi Newton method. (optimization, finance, quasi newton)

quasi_newton_dfp.m

image thumbnail

updated 5 years ago

Steepest descent method by Bapi Chatterjee

It solves an optimization problem by steepest descent method. (optimization, finance, steepest descent)

steepestdescent.m

image thumbnail

updated 5 years ago

convexchecker by Bapi Chatterjee

It checks real valued multidimensional function, whether it is convex. (optimization, finance, convex)

convexchecker.m

image thumbnail

updated 7 years ago

Finds convex polygon defined by random 2D points by christian delusier

Finds convex polygon defined by random 2D points (polygon, convex, finds)

image thumbnail

updated 9 years ago

quadprog2 - convex QP solver by Michael Kleder

Solves convex constrained quadratic programming (QP) using SOLVOPT. (optimization, convex, constrained)

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)

Contact us