Polytope - vertices vs inequalities

106 days ago by jrp

# Compute the simplex from a list of vertices P = Polyhedron(vertices=[[0,0,0,0],[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]) for h in P.Hrepresentation(): print h 
        
An inequality (-1, -1, -1, -1) x + 1 >= 0
An inequality (1, 0, 0, 0) x + 0 >= 0
An inequality (0, 1, 0, 0) x + 0 >= 0
An inequality (0, 0, 1, 0) x + 0 >= 0
An inequality (0, 0, 0, 1) x + 0 >= 0
An inequality (-1, -1, -1, -1) x + 1 >= 0
An inequality (1, 0, 0, 0) x + 0 >= 0
An inequality (0, 1, 0, 0) x + 0 >= 0
An inequality (0, 0, 1, 0) x + 0 >= 0
An inequality (0, 0, 0, 1) x + 0 >= 0
# Compute the cube from a list of inequalities Q = Polyhedron(ieqs = [[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,-1,0,0],[1,0,-1,0],[1,0,0,-1]]) for v in Q.Vrepresentation(): print v 
        
A vertex at (1, 1, 0)
A vertex at (0, 1, 0)
A vertex at (0, 0, 0)
A vertex at (1, 0, 0)
A vertex at (0, 0, 1)
A vertex at (1, 0, 1)
A vertex at (0, 1, 1)
A vertex at (1, 1, 1)
A vertex at (1, 1, 0)
A vertex at (0, 1, 0)
A vertex at (0, 0, 0)
A vertex at (1, 0, 0)
A vertex at (0, 0, 1)
A vertex at (1, 0, 1)
A vertex at (0, 1, 1)
A vertex at (1, 1, 1)