3 Downloads
Updated 11 Jul 2005
No License
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:
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
Michael Kleder (2021). VERT2CON - vertices to constraints (https://www.mathworks.com/matlabcentral/fileexchange/7895-vert2con-vertices-to-constraints), MATLAB Central File Exchange. Retrieved .
Inspired: Analyze N-dimensional Polyhedra in terms of Vertices or (In)Equalities
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Create scripts with code, output, and formatted text in a single executable document.
Hello everyone,
Suppose I have V= 30x14 matrix. Can I visualize what are the points lie on the boundary of the convex region? Actually, I want a similar figure as given on the top left of this page "VERT2CON - vertices to constraints". Is it possible?
Thanks in Advance.
#MSA
Made my life a lot easier. Thank you guys.
Nice program. How do I enforce constraints for points to lie only on the boundary of the convex hull?
Excellent program!
Very useful for calculating 3-dimensional convex masks.
A few speedups for newer versions replacing REPMAT with BSXFUN:
V = bsxfun(@minus,V,c);
and in the example:
p = bsxfun(@le,A*p,b);
nice work..keep it up!
Thanx Michael,
great program! and very elegantly coded as well.