Code: Select all

`polytope > $p = new Polytope<QuadraticExtension>(EQUATIONS=>[[1,2,3]], INEQUALITIES=>[[1,0,0]]);`

polytope > $p->VERTICES;

polymake: used package tosimplex

Dual simplex algorithm implemented by Thomas Opfer

polymake: WARNING: Recompiling application common in extension /Users/mkoeppe/.polymake/wrappers.0, please be patient...

polymake: WARNING: could not compute 'VERTICES' probably because of unsatisfied preconditions:

precondition : FEASIBLE ( VERTICES, LINEALITY_SPACE, CONE_DIM : CONE_AMBIENT_DIM )

precondition : COMBINATORIAL_DIM ( F_VECTOR : N_FACETS, N_RAYS, GRAPH.N_EDGES, DUAL_GRAPH.N_EDGES, COMBINATORIAL_DIM )

precondition : FULL_DIM ( LINEAR_SPAN : CONE_AMBIENT_DIM )

precondition : POINTED ( beneath_beyond.convex_hull.primal, default.triangulation.poly: FACETS, LINEAR_SPAN, RAYS_IN_FACETS, DUAL_GRAPH.ADJACENCY, TRIANGULATION(new).FACETS, ESSENTIALLY_GENERIC : RAYS )

precondition : COMBINATORIAL_DIM ( N_RAYS : F_VECTOR )

precondition : FULL_DIM ( beneath_beyond.convex_hull.dual: RAYS, LINEALITY_SPACE, RAYS_IN_FACETS, GRAPH.ADJACENCY : FACETS )

precondition : COMBINATORIAL_DIM ( DUAL_GRAPH.ADJACENCY : HASSE_DIAGRAM.ADJACENCY, HASSE_DIAGRAM.DECORATION, HASSE_DIAGRAM.INVERSE_RANK_MAP, HASSE_DIAGRAM.TOP_NODE, HASSE_DIAGRAM.BOTTOM_NODE )

precondition : COMBINATORIAL_DIM ( F_VECTOR : F2_VECTOR )

precondition : COMBINATORIAL_DIM ( GRAPH.ADJACENCY : HASSE_DIAGRAM.ADJACENCY, HASSE_DIAGRAM.DECORATION, HASSE_DIAGRAM.INVERSE_RANK_MAP, HASSE_DIAGRAM.TOP_NODE, HASSE_DIAGRAM.BOTTOM_NODE )

precondition : FULL_DIM ( beneath_beyond.convex_hull.dual: FACETS, RAYS, LINEAR_SPAN, LINEALITY_SPACE, RAYS_IN_FACETS, GRAPH.ADJACENCY : INEQUALITIES )

precondition : FEASIBLE ( FACETS, AFFINE_HULL, CONE_DIM : CONE_AMBIENT_DIM )