### Refine by Time Frame

updated 4 months 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

### Matt J (view profile)

Express bounded polyhedron via equalities/inequalities or vertices.

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

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

[varargout]=qlcon2vert(x0,varargin)

updated 4 years ago

### Sergii Iglin (view profile)

28 functions for different tasks of graph theory

BG=grBase(E)

CBG=grCoBase(E)

CoCycles=grCoCycleBasis(E)

updated 5 years ago

### Dirk-Jan Kroon (view profile)

Accurate smoothing of triangulated patch / mesh

FV2=smoothpatch(FV,mode,itt,lambda,sigma)

Ne=vertex_neighbours(FV)

Ne=vertex_neighbours_double(Fa,Fb,Fc,Vx,Vy,Vz)

updated almost 6 years ago

### Dirk-Jan Kroon (view profile)

Calculates the normal vectors of a triangulated mesh (patch)

N=patchnormals(FV)

[Nx,Ny,Nz]=patchnormals_double(Fa,Fb,Fc,Vx,Vy,Vz)

updated almost 7 years ago

### Joseph Kirk (view profile)

converts graph of vertices and edges to adjacency matrix and xy points

ve2axy(V,E)

updated almost 7 years ago

### Joseph Kirk (view profile)

converts graph of adjacency matrix and xy points to vertices and edges

axy2ve(A,xy)

updated 8 years ago

### David Ferrari (view profile)

Calculates the curvature of a triangulated surface

bqcurv(R, n),

updated 9 years ago

### Michael Kleder (view profile)

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