| /dports/math/polymake/polymake-4.5/demo/ |
| H A D | matroid-flowtest.ipynb | 15 "a certain polytope defined using the circuits of $M$ that pass through $e$ has\n",
138 …f-spaces is an unbounded polytope; an expression for a polytope in this fashion is called an $H$-r…
141 "A polytope can also be described by its vertices or extreme points and, if it\n",
142 …"is unbounded, its rays in addition. The matroid is $\\{e\\}$-flowing if the polytope described ab…
143 "coordinates. The description of a polytope by its vertices (and rays) is called\n",
160 "1. Construct a polytope in polymake using the H-representation\n",
296 "Finally we can create the polytope and ask for its vertices!\n"
305 "application \"polytope\";"
373 "is a vertex of the associated polytope.\n",
375 …"A polytope whose vertices are integral is also called a <i>lattice polytope</i>. If this is sati…
|
| /dports/math/gap/gap-4.11.0/pkg/PolymakeInterface-2019.09.02/gap/ |
| H A D | types.gi | 28 Print( "<an external polymake polytope>" );
58 Print( "<an external polymake tropical polytope>" );
98 Print( "An external polymake polytope.\n" );
118 Print( "An external polymake tropical polytope.\n" );
|
| /dports/math/polymake/polymake-4.5/apps/polytope/src/ |
| H A D | common_refinement.cc | 25 namespace polymake { namespace polytope { in cocircuit_equations()
30 BigObjectType polytope("Polytope", mlist<Scalar>()); in cocircuit_equations()
37 BigObject p(polytope, "VERTICES", vertices.minor(intersection, All)); in cocircuit_equations()
|
| /dports/math/polymake/polymake-4.5/apps/polytope/rules/ |
| H A D | orbit_polytope_helpers.rules | 97 # Constructs the NOP-graph of an orbit polytope.
100 # @param Matrix points the vertices of the orbit polytope
101 # @param Matrix lattice_points the lattice points of the orbit polytope
111 # # construct orbit polytope orb_\Gamma($gen_point)
198 # Projects a symmetric polytope in R<sup>4</sup> cap H<sub>1,k</sub> to R<sup>3</sup>.
200 # @param Polytope p the symmetric polytope to be projected
206 die "ortho_poly: the ambient dimension of the given polytope is not equal to 4!"
219 my $r = new polytope::Polytope(POINTS=>\@nvs);
226 # of the polytope. The parameter //wo_zero// decides whether
229 # @param Matrix vertices the vertices of the polytope
|
| H A D | common.rules | 26 # we might have a cone that already *is* a homogenized polytope,
91 # a polytope is k-simplicial if each k-face is a simplex,
120 # a polytope is k-face-simple if all k-faces are simple
189 # a polytope is k-cocubical if its dual is k-cubical
552 # compute minimal non-faces of a simplicial polytope
602 # returns the dimension of the polytope
617 # @param Polytope<Scalar> P polytope
674 # @category Producing a polytope from polytopes
694 # @category Producing a polytope from polytopes
725 # @category Producing a polytope from polytopes
[all …]
|
| H A D | arbitrary_coords.rules | 44 # and produces a triangulation of the polytope as a byproduct.
132 # @category Producing a polytope from scratch
168 # @category Producing a polytope from polytopes
197 # @category Producing a polytope from polytopes
212 # @category Producing a polytope from polytopes
232 # @category Producing a polytope from polytopes
260 # @category Producing a polytope from polytopes
261 # Decompose a given polytope into the free sum of smaller ones
367 croak("The set $face does not index a face of the input polytope or cone");
375 # Calculate the codegree of a cone or polytope P.
[all …]
|
| H A D | topcom.rules | 36 # Use the [[wiki:external_software#TOPCOM]] package for computing polytope triangulations.
58 # This converts a polytope, cone or point configuration into a format that topcom understands
220 # @param PointConfiguration pc or Polytope p input point configuration or polytope
231 # @param PointConfiguration pc or Polytope p input point configuration or polytope
260 # @param Polytope pc input polytope
270 # Computes the fiber polytope of a projection of point configurations P->Q via the GKZ secondary co…
271 # @param PointConfiguration pc (or Polytope) source point configuration or polytope
286 # Computes the fiber polytope of a projection of point configurations P->Q via the GKZ secondary co…
287 # @param PointConfiguration pc (or Polytope) source point configuration or polytope
288 # @param Polytope pc target polytope
[all …]
|
| /dports/math/polymake/polymake-4.5/apps/polytope/scripts/ |
| H A D | cuts | 3 application 'polytope';
19 # 1 cut + polytope
20 # 2 all cuts + polytope
25 die "usage: polymake --script cuts <polytope with LP> <n_cuts> <compose>\n" unless($#ARGV == 2);
29 die "defined for objects of type Polytope<Scalar> only" unless ref($poly) =~ m/^Polymake::polytope:…
|
| /dports/math/libnormaliz/normaliz-3.9.0/test/test-nf/ |
| H A D | icosahedron-v-place.ref | 4 1 lattice points in polytope
14 rank of recession cone = 0 (polyhedron is polytope)
28 1 lattice points in polytope:
|
| H A D | icosahedron-v-pull.ref | 4 1 lattice points in polytope
14 rank of recession cone = 0 (polyhedron is polytope)
28 1 lattice points in polytope:
|
| H A D | dodecahedron-v.ref | 4 7 lattice points in polytope
11 rank of recession cone = 0 (polyhedron is polytope)
25 7 lattice points in polytope:
|
| /dports/math/libnormaliz/normaliz-3.9.0/test/test-nf-hh/ |
| H A D | dodecahedron-v.ref | 4 7 lattice points in polytope
11 rank of recession cone = 0 (polyhedron is polytope)
25 7 lattice points in polytope:
|
| H A D | icosahedron-v.ref | 4 1 lattice points in polytope
11 rank of recession cone = 0 (polyhedron is polytope)
25 1 lattice points in polytope:
|
| /dports/math/libnormaliz/normaliz-3.9.0/test/test-/ |
| H A D | Hilb_latt_neeg.ref | 1 3 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
55 3 lattice points in polytope (module generators):
|
| H A D | rational_inhom_full.ref | 1 1 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
67 1 lattice points in polytope (module generators):
|
| /dports/math/polymake/polymake-4.5/bundled/lrs/apps/polytope/include/ |
| H A D | lrs_interface.h | 27 namespace polymake { namespace polytope { namespace lrs_interface {
45 class ConvexHullSolver : public LrsInstance, public polytope::ConvexHullSolver<Rational> {
79 class LP_Solver : public LrsInstance, public polytope::LP_Solver<Rational> {
|
| /dports/math/libnormaliz/normaliz-3.9.0/test/test-degenerate/ |
| H A D | empty0E.ref | 1 0 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
54 0 lattice points in polytope (module generators):
|
| H A D | empty0V.ref | 1 0 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
54 0 lattice points in polytope (module generators):
|
| H A D | empty2pointV.ref | 1 0 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
54 0 lattice points in polytope (module generators):
|
| H A D | empty2pointE.ref | 1 0 lattice points in polytope (module generators)
9 rank of recession monoid = 0 (polyhedron is polytope)
54 0 lattice points in polytope (module generators):
|
| /dports/math/libnormaliz/normaliz-3.9.0/test/test-LARGE/ |
| H A D | cyclicpolytope30-15.in | 1 /* cyclic polytope of dimension 15 with 30 vertices */
3 polytope 30
|
| /dports/math/polymake/polymake-4.5/bundled/sympol/external/sympol/data/permutation_polytopes/ |
| H A D | cross-polytope4.ext | 1 * permutation polytope of (1,2)(3,4),(3,4)(7,8),(5,6)(7,8)
2 * 4-dimensional cross polytope
|
| /dports/math/sympol/SymPol-0.1.9/data/permutation_polytopes/ |
| H A D | cross-polytope4.ext | 1 * permutation polytope of (1,2)(3,4),(3,4)(7,8),(5,6)(7,8)
2 * 4-dimensional cross polytope
|
| /dports/math/libccd/libccd-2.1/src/ |
| H A D | ccd.c | 100 ccd_pt_t polytope; in ccdGJKSeparate() local
104 ccdPtInit(&polytope); in ccdGJKSeparate()
106 ret = __ccdGJKEPA(obj1, obj2, ccd, &polytope, &nearest); in ccdGJKSeparate()
112 ccdPtDestroy(&polytope); in ccdGJKSeparate()
178 ccd_pt_t polytope; in ccdGJKPenetration() local
182 ccdPtInit(&polytope); in ccdGJKPenetration()
184 ret = __ccdGJKEPA(obj1, obj2, ccd, &polytope, &nearest); in ccdGJKPenetration()
196 if (penEPAPos(&polytope, nearest, pos) != 0){ in ccdGJKPenetration()
197 ccdPtDestroy(&polytope); in ccdGJKPenetration()
202 ccdPtDestroy(&polytope); in ccdGJKPenetration()
[all …]
|
| /dports/math/polymake/polymake-4.5/apps/group/rules/ |
| H A D | group_properties.rules | 78 …# @example [application polytope] The symmetry group of the cube induces a group action on its max…
87 …nput rays are commonly found in [[fan::PolyhedralFan::INPUT_RAYS]] or [[polytope::Cone::INPUT_RAYS…
98 …es). These rays are commonly found in [[fan::PolyhedralFan::RAYS]] or [[polytope::Cone::INPUT_RAYS…
107 … on inequalities (via their indices). These inequalities are found in [[polytope::Polytope::INEQUA…
108 …# @example [application polytope] The full symmetry group on a right triangle with inequalties def…
125 …ich operates on facets (via their indices). These facets are found in [[polytope::Polytope::FACETS…
126 …# To generate the combinatorial FACETS_ACTIONS of a general polytope, call [[polytope::combinatori…
127 …# @example [application polytope] The facets of a regular cube are affinely identical, i.e. the ac…
184 …perates on vectors (via their indices). These vectors can be found in [[polytope::VectorConfigurat…
185 …# @example [application polytope] [require bundled:sympol] The following constructs the linear sym…
|