• # plantri

• Referenced in 69 articles [sw10864]
• planar graphs, including triangulations, quadrangulations and convex polytopes. Many applications in the natural sciences ... given. These include triangulations, quadrangulations, convex polytopes, several classes of cubic and quartic graphs...
• # Convex

• Referenced in 33 articles [sw07770]
• Polyhedra can also be described as the convex hull of finitely many points and rays ... polyhedron is also called a polytope. In the Convex package, polyhedra are represented ... type POLYHEDRON and polytopes by the subtype POLYTOPE. A POLYHEDRON may contain lines ... generated by finitely many rays. In the Convex package, cones are represented by the type...
• # Normaliz

• Referenced in 168 articles [sw00630]
• computations in affine monoids, vector configurations, lattice polytopes, and rational cones. Its input data ... computes the defining hyperplanes, and vice versa), convex hulls, a triangulation of a vector ... cone, the lattice points of a rational polytope or unbounded polyhedron, the integer hull...
• # PALP

• Referenced in 70 articles [sw00672]
• programs for calculations with lattice polytopes and applications to toric geometry, which is freely available ... lattice points in the convex hull of a given set of points. In addition, there ... procedures specialised to reflexive polytopes such as the enumeration of reflexive subpolytopes, and applications...
• # StatePolytope

• Referenced in 7 articles [sw07236]
• StatePolytope computes state polytopes of ideals using the programs gfan, M2, and polymake. Specifically ... Sturmfels’s book Groebner bases and convex polytopes, page 14. There is also a function...
• # TPtool

• Referenced in 6 articles [sw11769]
• linear parameter-varying) dynamic models into polytopic forms, both in a theoretical and algorithmic context ... model transformation, different optimization and convexity constraints can be considered, and transformations can be executed ... model transformation generates two kinds of polytopic models. Firstly, it numerically reconstructs the HOSVD (Higher ... model transformation generates various convex polytopic forms, upon which LMI (Linear Matrix Inequality) based multi...
• # Polyrun

• Referenced in 2 articles [sw36601]
• library for sampling from the bounded convex polytopes. Polyrun is a Java library that provides ... methods for exploiting the bounded convex polytopes. Such polytopes define a space of feasible problem ... efficient uniform sampling from the convex polytopes. Moreover, it implements other procedures, such as Ball...
• # SlackIdeals

• Referenced in 2 articles [sw33429]
• tool to study classical realizability problems for polytopes. We introduce the package SlackIdeals for Macaulay2 ... slack matrices and slack ideals of convex polytopes and matroids. Slack ideals are often difficult...