Vertices

CON2VERT - convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities;i.e., solve the "vertex enumeration" problem.V = con2vert(A,b)Converts the polytope (convex polygon, polyhedron, etc.) defined by the system of inequalities A*x = n (m...

Consider the digraph with N vertices and M arcsN Vertices of the graph is expressed by the numbers 1,d-deTZ,N.Given the capacities of arcs, the demand functions of vertices and the cost functions of the arcs, then define the flow network of the given flow network.This function computes the...

This function generates patch data (faces d-deDUFd-deDt, vertices d-deDUVd-deDt and color data d-deDUCd-deDt) for 3D images. The patches are only generated for the voxels specified by the linear indices in d-deDUINDd-deDt. The variable d-deDUptyped-deDt indicatesthe type of patch:d-de?vd-deOao...


Platforms: Matlab

Points2One is a QGis plugin for creating polygons or polylines from vertices.


Platforms: *nix

Mesh Viewer is an easy to use lightweight application to display triangular meshes from a variety of file formats (see 3D formats). Mesh Viewer uses the OpenGL API to render the models. The program was born under the need for quickly displaying reconstructed triangulated meshes. The Mesh Viewer...


Platforms: *nix

Math::Amoeba is a Multidimensional Function Minimization. SYNOPSIS use Math::Amoeba qw(ConstructVertices EvaluateVertices Amoeba MinimiseND); my ($vertice,$y)=MinimiseND(@guess,@scales,&func,$tol,$itmax,$verbose); my @vertices=ConstructVertices(@vector,@offsets); my...


Platforms: *nix

SDGB, also know as Software for Determining Balanced Graph is designed as a computational method for determining whether a given graph with weights on the vertices, is balanced. SDGB was developed with the help of the Java programming language and can run on multiple platforms.


Platforms: Windows

Ok, so we have already mentioned tubes, great for corridors and lifts and we know that we can tessellate the tubes or any other object by selecting vertices and then selecting the tessellation functionality. We can select vertices within and object and then divide the object into two and from...


Platforms: Windows

Fits and scores vertices from models onto reference vertices to find its polyhedral identity and symmetry quantitatively. Java based with GUI


Platforms: Windows, Mac, Linux

This script returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y). The convex hull algorithm is Graham's scan, using a coordinate-based sorted order rather...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

This script finds the shortest paths from the start vertex to all vertices nearer than or equal to the end.The input graph G is assumed to have the following representation: A vertex can be any object that can be used as an index into a dictionary. G is a dictionary, indexed by vertices.For any...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

[Fs,Vs]=subtri(F,V,n)Sub-triangulates the triangles defined by the patch format data F (faces) and V (vertices). Can be used to increase the density of triangulated data or to triangulate the icosahedron to create geodesic sphere triangulations with desired density.Creates n addition points on...


Platforms: Matlab

View factor is a MATLAB function that uses the CDIF (contour double integral formula) to calculates view factors between planar surfaces(polygons), no matter what are the shape and the orientation of the two figures.All you need to enter is the coordinates of the vertices that define the outlines...


Platforms: Matlab

VERT2CON - convert a set of points to the set of inequality constraints which most tightly contain the points; i.e., create constraints to bound the convex hull of the given points[A,b] = vert2con(V)V = a set of points, each ROW of which is one pointA,b = a set of constraints such that A*x


Platforms: Matlab

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

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

Agraffe is a basic visual environment for the design and analysis of graphs. Design goals include fast entry of vertices and edges, a range of automatic manipulations, and the ability to export in many file formats. Try it and you'll be "agraf?*A*"!


Platforms: Mac

igraph is a free software package for creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community...


Platforms: *nix

This module extends Greg Bacon's implementation on clique reduction with regular expression. Originally can be found at: http://home.hiwaay.net/~gbacon/perl/clique.html The function take clique size (k) and vertices (list of lists) and return all the vertices that form the clique. K-clique...


Platforms: *nix

Maths Toolkit is a tool designed jointly by Intel and the British Mathematics Association, whose aim is to make it easier for students to learn the various fields of mathematics, and principally focussed on cartesian maps.Maths Toolkit is divided into different three parts:- Co-ordinates and...


Platforms: Windows