Polytope dualization

623 days ago by swinarsk

P = Polyhedron(rays=[[7,1,-3],[1,-5,3],[1,7,3]]) 
       
       
A 3-dimensional polyhedron in QQ^3 defined as the convex hull of 1
vertex and 3 rays.
A 3-dimensional polyhedron in QQ^3 defined as the convex hull of 1 vertex and 3 rays.
P.Hrepresentation() 
       
[An inequality (1, -1, 2) x + 0 >= 0, An inequality (1, 2, 3) x + 0
>= 0, An inequality (3, 0, -1) x + 0 >= 0]
[An inequality (1, -1, 2) x + 0 >= 0, An inequality (1, 2, 3) x + 0 >= 0, An inequality (3, 0, -1) x + 0 >= 0]
P.show() 
       
Q=Polyhedron(ieqs = [[0,1,2,3],[0,1,-1,2],[0,3,0,-1]]) 
       
       
A 3-dimensional polyhedron in QQ^3 defined as the convex hull of 1
vertex and 3 rays.
A 3-dimensional polyhedron in QQ^3 defined as the convex hull of 1 vertex and 3 rays.
Q.Vrepresentation() 
       
[A ray in the direction (1, -5, 3), A ray in the direction (1, 7, 3), A
ray in the direction (7, 1, -3), A vertex at (0, 0, 0)]
[A ray in the direction (1, -5, 3), A ray in the direction (1, 7, 3), A ray in the direction (7, 1, -3), A vertex at (0, 0, 0)]