A convex polyhedron is defined as the set of solutions to a system of linear inequalities m x<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real s-vector. Given m and b, vertex enumeration is the determination of the polyhedron's polyhedron vertices.

computational geometry | convex hull | convex polyhedron | polyhedron