Vertices
An implementation of "A min cut algorithm" by Stoer and Wagner.In addition there is an option to find the minimal cut that does not separate a set of vertices.This is not a mincut-maxflow algorithm.Updated version.
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (44): A simple min cut algorithm Download |
plot_feasible(A, b, c, lower_b, upper_b, varargin)Plots the feasible region of the 2D linear program maximize f = c'*x subject to A x
Platforms: Matlab
License: Freeware | Size: 20.48 KB | Download (43): plot_feasible.m Download |
voronoiSkel uses only the pixel on the boundary of the objects, and therefore is very efficient for thick objects (efficiency scales with the object's radius, rather than its area). However, it might be sensitive to small defects, if they are on the boundaries (or small holes inside the...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (47): Skeletonization using voronoi Download |
This function calculates the principal curvature directions and values of a triangulated mesh. The function first rotates the data so the normal of the current vertex becomes [-1 0 0], so we can describe the data by XY instead of XYZ. Secondly it fits a least-squares quadratic patch to the local...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 296.96 KB | Download (40): Patch Curvature Download |
dpsimplify uses the recursive Douglas-Peucker line simplification algorithm to reduce the number of vertices in a polyline according to a specified tolerance. The algorithm is also know as Iterative Endpoint Fit algorithm. dpsimplify can handle polylines and polygones in 2d and higher...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (41): Line Simplification Download |
Given a input adjacent matrix (AdjMax) that represents a weighted, directed graph. The function finds the shorest path from one vertex 'i' to another 'j'. The return values includes a matrix (S) that denotes the shortest distance between vertices 'i' and 'j', and a matrix (P) that denotes the...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (45): Floyd Shortest Path Routing Download |
Calculation of intersection segment between a plane (defined with a point p0 that lies on the plane and a normal vector n of that plane) and a triangle (defined with its vertices P1, P2 and P3)N : Normal to plane , |N| = 1, N->(nx3)Q : Point into the plane, Q->(nx3)P1,P2,P3 : Triangle vertices,...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 20.48 KB | Download (44): IntersectPlaneTriangle mex Download |
Returns a sparse adjacency matrix 'mAdj' according to the incidence matrix 'mInc'. The rows in the incidence matrix must represent the edges, while the columns the vertices.Function can handle directed graphs with incidence matrix containing -1s, indicating an "in-going" edge, and 1s indicating...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (44): Graph incidence matrix to adjacency matrix Download |
This function ISOCONTOUR computes the isocontour geometry for a certain 2D image and isovalue. To Extract the isocontour geometry it uses Marching Squares and linear interpolation. Followed by sorting the contour geometry into separate contour-objects. This function is the 2D equivalent of...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (46): Isocontour Download |
%SPLITFV Splits faces and vertices into connected pieces% FVOUT = SPLITFV(F,V) separates disconnected pieces inside a patch defined by faces (F) and% vertices (V). FVOUT is a structure array with fields "faces" and "vertices". Each element of% this array indicates a separately connected patch.%%...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (44): splitFV - split a mesh Download |
This function "refinepatch" can refine any triangular mesh surface ( patch) with 4-split spline interpolation, see screenshot.Literature:The spline interpolation of the face edges is done by the Opposite Edge Method, described in: "Construction of Smooth Curves and Surfaces from Polyhedral...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (43): Triangular Mesh Refinement Download |
Given a conforming triangulation as as matrix of vertices numbers corresponding to each triangular element , the algorithm generates and numbers edges of triangulation, so that edges shared by two elements are counted only once. It also generates list of edges belonging to each triangle a list of...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 2.97 MB | Download (51): Edges generation Download |
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graphThe zip file containskruskal.m iscycle.m fysalida.m connected.mIf we want to find the minimum spanning tree. We call function kruskal.% Input: PV = nx3 martix. 1st and...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (41): Kruskal Algorithm Download |
This function carries out the following tasks:1) Imports a SMS .2dm mesh file.2) Creates a 'patch' plot of the mesh, where the user can specify the colormap, shading, lighting conditions, and level of transparency.3) Exports the mesh nodes and elements to the MATLAB workspace as faces and...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 143.36 KB | Download (40): view2dm Download |
The function circumcircle takes input as the coordinates of the three vertices of a triangle and compute the circum center and circum radius by using the formula in terms of the length of sides and area of triangle and plot the circumcircle.
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (45): Circumcircle of a triangle Download |
In the mathematical field of graph theory, a spanning tree of a connected, undirected graph is a tree which includes every vertex of that graph. More generally, a spanning forest of an arbitrary undirected graph is a forest which includes every vertex of the graph. Spanning forests always exist,...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (45): Prims Algorithm Download |
Edit a graph or draw a new one with this GUI.Usage:>> graph_gui;or>> graph_gui(A,xy); Controls:Use the radio buttons to select an action:1. To DRAW a new VERTEX, select 'Draw' and 'Vertex'. Then click inside the axes in the desired location.2. To DELETE a VERTEX, select 'Delete' and 'Vertex'....
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (44): Graph GUI Download |
SYNOPSIS: patchTexture(patchHandle,texture)INPUTpatchHandle: handle to patch objecttexture: texture to map onto the surface defined via patch Texture can be a grayscale or an RGB imageOUTPUTnone - the texture is mapped onto the patch identified bypatchHandle by reading the image at the [x,y]...
Platforms: Matlab
License: Shareware | Cost: $0.00 USD | Size: 10 KB | Download (41): Map texture to patch Download |
The user can customize the graphic output.He can modify the colors, font faces, vertices annotations, how to fill the selected area (slants, diagonals, lines or solid color), overlaping area style and many more.
Platforms: Matlab
License: Freeware | Size: 20.48 KB | Download (44): plot_feasible about Mathematics Script Download |
Kineme3D provides support for 3D models in Quartz Composer. Supported formats include FBX, OBJ, DXF, DAE, MD2, 3DS, and a bunch of other formats. Not only can you render your models, you can also deform them in various ways. Twisting, Gravity, Scaling, Bend Boxes, and Quantization are a few...
Platforms: Mac
License: Shareware | Cost: $0.00 USD | Size: 9.76 MB | Download (37): Kineme3D Download |