mplrs
package to enumerate vertices and extreme rays of a convex polyhedron (parallel binary)
Command lineScience
Not tested on a device yet. What that means
Commands in the package
mplrs
About mplrs
From Debian's package description
A convex polyhedron is the set of points satisfying a finite family of linear inequalities. The study of the vertices and extreme rays of such systems is important and useful in e.g. mathematics and optimization. In a dual interpretation, finding the vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search) has two important features that can be very important for certain applications: it works in exact arithmetic, and it consumes memory proportional to the input, no matter how large the output is.
This package contains the parallel binary mplrs for use with mpi
From Debian's description of the mplrs package, under that package's license.
Dependencies
Depends on
libc6libgmp10libopenmpi40
Related apps
- lrslibpackage to enumerate vertices and extreme rays of a convex polyhedronCommand line
- qhull-bincalculate convex hulls and related structures (utilities)Command line
- 4ti2mathematical tool suite for problems on linear spaces -- toolsCommand line
- tippecanoebuild vector tilesets from large collections of GeoJSON featuresCommand line
- ngmlrCoNvex Gap-cost alignMents for Long ReadsCommand line
- latte-intLattice point EnumerationCommand line
Sources and licenses
- Name: the Debian package name.
- Summary: Debian's short description of the mplrs package, under that package's license.
- Description: Debian's description of the mplrs package, under that package's license.
- Versions and sizes: Debian's archive for ARM64, as on packages.debian.org.
- Popularity: Debian Popularity Contest counts.
More in About the catalog.