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 3 years ago

grTheory - Graph Theory Toolbox by Sergii Iglin

28 functions for different tasks of graph theory (vertex, edge, matching)

BG=grBase(E)

CBG=grCoBase(E)

CoCycles=grCoCycleBasis(E)

image thumbnail

updated 4 years ago

Smooth Triangulated Mesh by Dirk-Jan Kroon

Accurate smoothing of triangulated patch / mesh (curvature, curvature flow, smoothing)

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

Ne=vertex_neighbours(FV)

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

image thumbnail

updated 5 years ago

Patch Normals by Dirk-Jan Kroon

Calculates the normal vectors of a triangulated mesh (patch) (patch, isosurface, normals)

N=patchnormals(FV)

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

image thumbnail

updated 6 years ago

VE2AXY by Joseph Kirk

converts graph of vertices and edges to adjacency matrix and xy points (graph, digraph, adjacency matrix)

ve2axy(V,E)

image thumbnail

updated 6 years ago

AXY2VE by Joseph Kirk

converts graph of adjacency matrix and xy points to vertices and edges (graph, digraph, adjacency matrix)

axy2ve(A,xy)

image thumbnail

updated almost 8 years ago

bqcurv by David Ferrari

Calculates the curvature of a triangulated surface (surface, curvature, vertex)

bqcurv(R, n),

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