#18190: bindings to Latte
-------------------------------+------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: interfaces | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #18195 | Stopgaps:
-------------------------------+------------------------
Comment (by jdemeyer):
Replying to [comment:5 vdelecroix]:
> Replying to [comment:4 jdemeyer]:
> > What is the input for `latte`? I assume a polyhedron given by its
''vertices'' (V-representation) or does it also support a polyhedron given
by constraints (H-representation)?
>
> By constraints.
...only?
It is required that the vertices are lattice points?
I ask because `Polyhedron()` in Sage always computes the vertices. I know
from #17920 that this step sometimes takes more time than enumerating the
points. So if you really want efficiency, you would want a way to define a
`Polyhedron` ''without'' computing its vertices.
--
Ticket URL: <http://trac.sagemath.org/ticket/18190#comment:6>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
