{"name":"cddlib","portdir":"devel/cddlib","version":"0.94n","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://people.inf.ethz.ch/fukudak/cdd_home","description":"An efficient implementation of the Double Description Method","long_description":"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: \n P = { x = (x_1, ..., x_d)^T : b - Ax >= 0 } \n where A is a given m×d real matrix, b is a given m-vector, and 0 is the m-vector of all zeros.","active":true,"categories":["devel","math"],"maintainers":[{"name":"dev","github":"McDaMastR","ports_count":35}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["gmp"]}],"depends_on":[{"type":"lib","ports":["TOPCOM","gfan","latte-int","singular","sympol"]}]}