Creating polyhedra and their Operations
Creating a polyhedron a CddPolyhedron The function takes a list in which every entry represents an inequality (or equality). In case we want some entries to represent equalities we should refer in a second list to their indices. <#Include Label="Example1"> a CddPolyhedron The function takes a list in which every entry represents a vertex in the ambient vector space. In case we want some vertices to be free (the vertex and its negative belong to the polyhedron) we should refer in a second list to their indices . <#Include Label="Example2">
Some operations on a polyhedron a CddPolyhedron The function returns the Fourier projection of the polyhedron in the subspace (O,x_1,\dots,x_{i-1},x_{i+1},\dots,x_n) after applying the Fourier elemination algorithm to get rid of the variable x_{i}. <#Include Label="Fourier">
Some operations on two polyhedrons true or false The function returns true if P_1 is contained in P_2, otherwise returns false. <#Include Label="comparing_polyhedrons"> a CddPolyhedron The function returns the intersection of P_1 and P_2 <#Include Label="intersection"> a CddPolyhedron The function returns the Minkuwski sum of P_1 and P_2. <#Include Label="minkuwski">