C = coneFromVData M
C = coneFromVData(M,N)
C = coneFromVData(C1,C2)
C = coneFromVData P
C = coneFromVData L
Please see V and Hrepresentation on the conventions we use for cones and polyhedra.
coneFromVData computes the positive hull of the input. In the first two cases it considers the columns of M as a set of rays and the columns of N (if given) as generators of the lineality space and computes the cone that is the positive hull of the rays plus the lineality space. The two matrices must have the same number of rows, i.e. the columns must lie in the same ambient space. If N is not given or equal to 0 then the resulting cone is pointed. The rays need not be a minimal generating set of the cone. If two cones are inserted it computes their positive hull if they lie in the same ambient space. In the case of a polyhedron it computes the cone given by all positive multiples of points of the polyhedron. If applied to a list, it may contain a combination of the following in any order.
Then coneFromVData computes the positive hull of all inserted objects, if they are in the same ambient space, i.e. all matrices must have the same number of rows, which must equal the ambient dimension of all cones and polyhedra.
As a first example consider the following 2 dimensional cone in 3 space:


We can construct a full dimensional cone out of this one by adding a lineality space for example:


The resulting cone is not pointed anymore, because it contains the subspace spanned by (0,0,1). To get a full dimensional pointed cone we have to add another ray to C. For this we can apply coneFromVData to a list containing C and the new ray:


Another way would be, if we would have r not as a ray but already as a cone:

In this case we can just take the positive hull of the two cones:


The object coneFromVData is a method function.