
polymake
 Referenced in 213 articles
[sw00724]
 combinatorics and the geometry of convex polytopes and polyhedra. It is also capable of dealing...

LattE
 Referenced in 88 articles
[sw04654]
 counting lattice points and integration inside convex polytopes. LattE contains the first ever implementation...

plantri
 Referenced in 37 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...

PORTA
 Referenced in 88 articles
[sw04869]
 analyzing polytopes and polyhedra. The polyhedra are either given as the convex hull...

Convex
 Referenced in 22 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...

TiGERS
 Referenced in 8 articles
[sw12585]
 bijection with the vertices of a convex polytope known as the state polytope...

Normaliz
 Referenced in 77 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 35 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...

StochaTR
 Referenced in 3 articles
[sw11113]
 coefficients, an uncertainty set is a convex polytope that can be exactly calculated. We construct...

rcdd
 Referenced in 2 articles
[sw08186]
 forth between two representations of a convex polytope: as solution of a set of linear...

lattice_polytope
 Referenced in 1 article
[sw21169]
 with lattice and reflexive polytopes. A convex polytope is the convex hull of finitely many...

TPtool
 Referenced in 1 article
[sw11769]
 linear parametervarying) 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...

gfanlib
 Referenced in 2 articles
[sw15679]
 features of convex geometry through an interface to Gfanlib. It contains cones, polytopes and fans...

mplrs
 Referenced in 1 article
[sw21787]
 convex polyhedra. The problems chosen span the range from simple to highly degenerate polytopes...

Vinci
 Referenced in 1 article
[sw21789]
 range from rather classical ones as in convex optimisation to problems in remote fields like ... polynomials can be related to a special polytope volume. Part of the fascination...

IPO
 Referenced in 0 articles
[sw15166]
 function. This is in contrast to usual convexhull algorithms which produce the entire description ... MIPLIB 2.0, facetdetection for matching polytopes with one quadratic objective term and adjacency statistics...

cdd
 Referenced in 85 articles
[sw00114]
 The program cdd+ (cdd, respectively) is a C...

CGAL
 Referenced in 244 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CSDP
 Referenced in 162 articles
[sw00169]
 CSDP, A C Library for Semidefinite Programming. This...

GAP
 Referenced in 1900 articles
[sw00320]
 GAP is a system for computational discrete algebra...