How to find the intersection polyhedron of two bigger polyhedra?

I used convhulln to get the vertices of these two polyhedra, now I try to get a new convex polyhedron which is the intersection of two bigger polyhedra, and its vertices .

Is there any tips for solving this problem? Thanks a lot.

Answer 1

[Matt J]

You can use VERT2LCON and LCON2VERT ( Download ). Use VERT2LCON to obtain the inequalities describing each polyhedron

      [A1,b1]=vert2lcon(vertices1);
      [A2,b2]=vert2lcon(vertices2);

Combining the inequalities into a single system gives a representation for the intersection polyhedron, and its vertices can be obtained with

     vertices = lcon2vert([A1;A2], [b1;b2]);

[Qiu]

Much thanks,but could you describe these functions more explicit?What does the return A,b mean?

I major in Optics ,so I am not familiar with computer graphics.This problem was encountered when I tried to solve gammut mapping.

[Matt J]

A polyhedron is the set of points satisfying some set of inequalities A*x<=b. The tools I referenced let you find the inequalities from the vertices or the inequalities from the vertices. There is help documentation in the FEX submission that explains a lot of this.