Refine by Time Frame

updated 2 months ago

Matt J (view profile)

Express polyhedra by vertices or (in)equalities. Also, find intersections and unions.

intersectionHull(varargin)

lcon2vert(A,b,Aeq,beq,TOL,checkbounds)

updated 10 months ago

Sulimon Sattari (view profile)

inpolygon function that works using gpuArray

inpolygon_for_gpu(testx,testy,vertx,verty)

updated 1 year ago

George Papazafeiropoulos (view profile)

Convex hull, mesh generation, Delaunay triangulation, Voronoi diagram and other algorithms.

Bounding box of a random point set in 2-dimensional space

Bounding box of a random point set in 3-dimensional space

Bounding box of a random point set in 4-dimensional space

updated 1 year ago

John D'Errico (view profile)

Least squares spline modeling using shape primitives

slm_tutorial

hermite2slm(harray)

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

updated 2 years ago

Sulimon Sattari (view profile)

This function generates an array of points that lie within a given polygon

polygrid( xv, yv, ppa)

updated almost 4 years ago

Krishna Lalith (view profile)

Identify the Reflections using Convex Lens from Object to Image.

ConvexLens(action)

Image_Board(ObjSize,ObjPos,ObjNat,hand)

updated 6 years ago

Bapi Chatterjee (view profile)

It solves an optimization problem by DFP quasi Newton method.

quasi_newton_dfp.m

updated 6 years ago

Bapi Chatterjee (view profile)

It solves an optimization problem by steepest descent method.

steepestdescent.m

updated 6 years ago

Bapi Chatterjee (view profile)

It checks real valued multidimensional function, whether it is convex.

convexchecker.m

updated almost 9 years ago

christian delusier (view profile)

Finds convex polygon defined by random 2D points

Return_points_polyg_direct.m

updated 10 years ago

Michael Kleder (view profile)

Solves convex constrained quadratic programming (QP) using SOLVOPT.