
VERT2CON  vertices to constraints 1.0 File ID: 79421 


 VERT2CON  vertices to constraints 1.0 License: Freeware File Size: 10.0 KB Downloads: 8
Submit Rating: 



VERT2CON  vertices to constraints 1.0 Description 

Description: 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 point A,b = a set of constraints such that A*x <= b defines the region of space enclosing the convex hull of the given points
For n dimensions: V = p x n matrix (p vertices, n dimensions) A = m x n matrix (m constraints, n dimensions) b = m x 1 vector (m constraints)
NOTES: (1) In higher dimensions, redundant constraints can appear. This program detects redundancy at 6 digits of precision (per dimension), then returns the unique constraints. (2) See companion function CON2VERT. (3) ver 1.0: initial version, June 2005. (4) ver 1.1: enhanced redundancy checks, July 2005 (5) Written by Michael Kleder
License: Freeware Related: Precision, digits, Dimension, returns, Unique, Redundancy, detects, Dimensions, higher, Redundant, Program, constraints, companion, checks, written, Michael, kleder, Enhanced, points O/S:BSD, Linux, Solaris, Mac OS X File Size: 10.0 KB Downloads: 8


More Similar Code 

This function is similar to MATLAB's inpolygon function, but allows the polygon vertices to describe multiple polygons, and allows these polygons to have holes in them. In the case of multiple polygons, it also returns the index of the polygon in which a point was found.
The routine performs a Voronoi decomposition of an input dataset and constrains the vertices to the domain of the data themselves, such that even unbounded Voronoi cells become useful polygons (See attached figure).
I asked some time...
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...
Dynamic economic dispatch is an important variant of economic dispatch,where the the ramp constraints also considered .This software presents a simple way of implementing the quadaratic programming to solve the problem.
Creates a 1,2 or 3 dimensional probability distribution supported on usersupplied lattice points subject to linear and moment constraints. A trite financial example is provided.
writeAvizoSurfMulti save several surfaces defined by vertices and triangular faces to a single Avizo?(VSG) compatible surface (HyperSurface 0.1 ASCII).
Usage: writeAvizoSurfMulti(faceList,vertexList,filename,idList,...
This submission contains VERT2LCON and LCON2VERT, which will find the linear constraints defining a bounded polyhedron in R^n, given its vertices, or vice versa. They are extensions of Michael Kleder's VERT2CON and CON2VERT functions that can...
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...
Snaps the 2D line object LINE_OBJ to one of the following constraints 
a. Other set of lines. b. Defined grid. c. Mouse cursor (no constraint).
Imposing Constraints on DataSet is a web based tutorial in which the author gives guidelines to the programmers about the method of adding constraints into the dataset. The author tells about the method of maintaining the integrity of data by... 
User Review for VERT2CON  vertices to constraints 
