q, a matrix, over QQ with only one column representing the closest point
Description
For a point p and a Polyhedron P or a Cone C, proximum computes the point in P or C with minimal euclidian distance to p.
i1 : P = crossPolytope 3
o1 = {ambient dimension => 3 }
dimension of lineality space => 0
dimension of polyhedron => 3
number of facets => 8
number of rays => 0
number of vertices => 6
o1 : Polyhedron