Thank you.
that's exactly what I was looking for.
bg,
Johannes
On 25.11.2012 14:56, Volker Braun wrote:
> Construct cone and hyperplane:
>
> sage: C = Cone([(1,0),(0,1)])
> sage: H = Polyhedron(eqns=[(-2,1,1)])
> sage: H.Hrepresentation()
> (An equation (1, 1) x - 2 == 0,)
>
> Compute the intersection polyhedron:
>
> sage: P = H.intersection( C.polyhedron() ); P
> A 1-dimensional polyhedron in QQ^2 defined as the convex hull of 2 vertices
> sage: P.Vrepresentation()
> (A vertex at (2, 0), A vertex at (0, 2))
>
>
> On Sunday, November 25, 2012 1:42:24 PM UTC, Johhannes wrote:
>
> Hi List,
> Is there a build-in-way to get the intersection of a given cone C with
> an given hyperplane h?
>
> In detail I have the following situation:
>
> C = Cone( [List of primitive generators] )
> H_h = Hyperplane {x : \sum x_i = h}.
>
> C intersected with H_h will be a bounded polytope.
>
> If there's not such an function, where would be the best place to place
> it? Extend/overwrite the existing intersection function of the cone?
>
> regards,
> Johannes
>
> --
> You received this message because you are subscribed to the Google
> Groups "sage-support" group.
> To post to this group, send email to sage-support@googlegroups.com.
> To unsubscribe from this group, send email to
> sage-support+unsubscr...@googlegroups.com.
> Visit this group at http://groups.google.com/group/sage-support?hl=en.
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
