cddlib
Library for finding vertices of convex polytopes
cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities.
There is no official package available for openSUSE Leap 15.5Dystrybucje
openSUSE Tumbleweed
openSUSE Leap 15.6
openSUSE Leap 15.5
openSUSE Leap 15.4
SUSE SLE-15-SP2
SUSE SLE-15-SP1
Niewspierane dystrybucje
Podane tu dystrybucje nie są oficjalnie wspierane. Używaj te paczki na własne ryzyko.